2107 search results - page 268 / 422 » Computing Small Search Numbers in Linear Time |
WADS
1997
Springer
14 years 1 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
EDBT
2004
ACM
14 years 9 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
SBBD
2008
13 years 10 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
PVLDB
2008
13 years 8 months ago
2008
The World-Wide Web consists of a huge number of unstructured documents, but it also contains structured data in the form of HTML tables. We extracted 14.1 billion HTML tables from...
SIAMCOMP
2010
13 years 4 months ago
2010
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...