2514 search results - page 375 / 503 » On the Computation of Approximations of Database Queries |
158
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
In this demonstration we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data. Deployed on any number of commodity ...
181
click to vote
NAR
2011
14 years 9 months ago
2011
The IUPHAR database is an established online reference resource for several important classes of human drug targets and related proteins. As well as providing recommended nomencla...
201
click to vote
PODC
2006
ACM
16 years 25 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
210
click to vote
CASC
2009
Springer
15 years 8 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
228
click to vote
PODS
1994
ACM
15 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...