Sciweavers

2836 search results - page 174 / 568
» Parsing Algorithms and Metrics
Sort
View
138
Voted
CIARP
2009
Springer
15 years 7 months ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...
SPRINGSIM
2010
15 years 2 months ago
GTNA: a framework for the graph-theoretic network analysis
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
Benjamin Schiller, Dirk Bradler, Immanuel Schweize...
IJCGA
2010
91views more  IJCGA 2010»
15 years 1 months ago
Pareto Envelopes in Simple Polygons
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann ...
AIIDE
2008
15 years 6 months ago
Learning and Playing in Wubble World
Children do not learn the meanings of words from parsing and understanding gigabytes of text; instead meanings are learned from competent speakers who relate language to what'...
Wesley Kerr, Paul R. Cohen, Yu-Han Chang
APPROX
2005
Springer
88views Algorithms» more  APPROX 2005»
15 years 9 months ago
Approximating the Best-Fit Tree Under Lp Norms
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
Boulos Harb, Sampath Kannan, Andrew McGregor