Sciweavers

443 search results - page 86 / 89
» SAT-Based Answer Set Programming
Sort
View
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
13 years 11 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
COMPGEOM
2005
ACM
13 years 9 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 5 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 1 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov