Sciweavers

191 search results - page 24 / 39
» Online Aggregation over Trees
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
IJCAI
2007
13 years 9 months ago
Automated Design of Multistage Mechanisms
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
Tuomas Sandholm, Vincent Conitzer, Craig Boutilier
CEC
2010
IEEE
13 years 8 months ago
Evolving cascades of voting feature detectors for vehicle detection in satellite imagery
We propose an evolutionary method for detection of vehicles in satellite imagery which involves a large number of simple elementary features and multiple detectors trained by genet...
Krzysztof Krawiec, Bartosz Kukawka, Tomasz Macieje...
SIGMOD
1997
ACM
131views Database» more  SIGMOD 1997»
13 years 12 months ago
Maintenance of Data Cubes and Summary Tables in a Warehouse
Data warehouses contain large amounts of information, often collected from a variety of independent sources. Decision-support functions in a warehouse, such as on-line analytical ...
Inderpal Singh Mumick, Dallan Quass, Barinderpal S...
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
13 years 12 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...