18090 search results - page 2955 / 3618 » Computing by Only Observing |
179
click to vote
CIKM
2005
Springer
16 years 22 days ago
2005
Springer
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
220
click to vote
CIKM
2005
Springer
16 years 22 days ago
2005
Springer
We present data representations, distance measures and organizational structures for fast and efficient retrieval of similar shapes in image databases. Using the Hough Transform w...
165
click to vote
COLT
2005
Springer
16 years 22 days ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
223
click to vote
CRYPTO
2005
Springer
16 years 22 days ago
2005
Springer
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
177
click to vote
DCOSS
2005
Springer
16 years 22 days ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...