2733 search results - page 533 / 547 » The Constellation Query Language |
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Manually querying search engines in order to accumulate a large body of factual information is a tedious, error-prone process of piecemeal search. Search engines retrieve and rank...
CHI
2003
ACM
15 years 10 months ago
2003
ACM
In the past, most early hands-on users of interactive software in organizations were individual contributors. Managers as early adopters is a new trend with significant implicatio...
108
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...