6274 search results - page 337 / 1255 » From query complexity to computational complexity |
205
click to vote
AAAI
2012
13 years 9 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
172
click to vote
MMM
1998
Springer
15 years 11 months ago
1998
Springer
A system for direct interaction with a video projection screen using a laser pointer is presented. The laser point on the screen is captured by a video camera, and its location re...
164
Voted
SEKE
2007
Springer
16 years 25 days ago
2007
Springer
Peer-to-Peer (P2P) systems seek to provide sharing of computational resources, which may be duplicated or versioned over several peers. Duplicate resources (i.e. replicas) are the...
174
Voted
SRDS
1998
IEEE
15 years 11 months ago
1998
IEEE
In the paper, an e cient image database system is developed. The most important features of the proposed system include compressed domain indexing, searching by using scalable fea...
173
click to vote
TCC
2007
Springer
16 years 25 days ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...