5356 search results - page 317 / 1072 » Adventures in time and space |
197
Voted
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
194
Voted
ALGORITHMICA
2007
15 years 6 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
213
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
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...
185
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
This paper offers a novel look at using a dimensionalityreduction technique called simhash [8] to detect similar document pairs in large-scale collections. We show that this algo...
209
click to vote
EUROPAR
2011
Springer
14 years 6 months ago
2011
Springer
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...