Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2004
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

Searching algorithm

  • To: mathgroup at smc.vnet.net
  • Subject: [mg48253] Searching algorithm
  • From: "Amir" <z64043 at netscape.net>
  • Date: Wed, 19 May 2004 02:42:49 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

Hello,

A =  2x2 matrix {{1,8,9,4,6,3},{1,7,9,11,8,54},{73,2,1,61,8,9},...}

Is there any algorithm which can find the most frequent subset of three
numbers ( like {1,8,9} ) that appears in  A ?

Thanks,

Amir





  • Prev by Date: how can I solve a transcendantale function?
  • Next by Date: Re: Maclaurin Series
  • Previous by thread: Re: how can I solve a transcendantale function?
  • Next by thread: Re: Searching algorithm