335 search results - page 60 / 67 » How to Use Spanning Trees to Navigate in Graphs |
179
click to vote
WAIM
2004
Springer
15 years 11 months ago
2004
Springer
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...
150
click to vote
WWW
2010
ACM
16 years 29 days ago
2010
ACM
As sophisticated enterprise applications move to the Web, some advanced user experiences become difficult to migrate due to prohibitively high computation, memory, and bandwidth r...
159
click to vote
ICNP
2007
IEEE
16 years 9 days ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
282
click to vote
NLP
2000
15 years 9 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
165
click to vote
ICPR
2008
IEEE
16 years 13 days ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...