6274 search results - page 139 / 1255 » From query complexity to computational complexity |
145
click to vote
MST
2010
14 years 10 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
125
click to vote
DEXA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...
152
click to vote
EDBTW
2006
Springer
15 years 7 months ago
2006
Springer
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
119
click to vote
CLOUD
2010
ACM
15 years 9 months ago
2010
ACM
Large-scale, user-facing applications are increasingly moving from relational databases to distributed key/value stores for high-request-rate, low-latency workloads. Often, this m...
175
click to vote
IEEECGIV
2006
IEEE
15 years 10 months ago
2006
IEEE
PathBank is a web-based query and visualization system for biological pathways using an integrated pathway database. To address the needs for biologists to visualize and analyze b...