4229 search results - page 464 / 846 » On the Optimality of Spiral Search |
251
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
172
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
190
click to vote
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
191
click to vote
IWOMP
2009
Springer
16 years 1 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
190
click to vote
FCCM
2008
IEEE
16 years 1 months ago
2008
IEEE
Internet Protocol (IP) lookup in routers can be implemented by some form of tree traversal. Pipelining can dramatically improve the search throughput. However, it results in unbal...