Sciweavers

1632 search results - page 87 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
141
Voted
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 4 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
112
Voted
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 9 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
119
Voted
FCT
2005
Springer
15 years 9 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
166
Voted
ICCV
2011
IEEE
14 years 3 months ago
Dynamic Manifold Warping for View Invariant Action Recognition
We address the problem of learning view-invariant 3D models of human motion from motion capture data, in order to recognize human actions from a monocular video sequence with arbi...
Dian Gong, Gerard Medioni
COCOON
2007
Springer
15 years 9 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang