14699 search results - page 486 / 2940 » Complexity and Cognitive Computing |
184
click to vote
ICALP
2005
Springer
16 years 24 days ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
187
click to vote
VAST
2004
ACM
2004
ACM
A Point-Based Approach for Capture, Display and Illustration of Very Complex Archeological Artefacts
16 years 22 days ago
In this paper we present a complete point-based pipeline for the capture, display and illustration of very large scans of archeological artifacts. This approach was developed as p...
179
click to vote
SAT
2004
Springer
16 years 19 days ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
182
click to vote
WEBI
2004
Springer
16 years 19 days ago
2004
Springer
As the amount of available data continues to increase, more and more effective means for discovering important patterns and relationships within that data are required. Although t...
189
click to vote
ICALP
2003
Springer
16 years 15 days ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...