Sciweavers

494 search results - page 60 / 99
» Heap Building Bounds
Sort
View
ATAL
2010
Springer
15 years 2 days ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
TKDE
2012
487views Formal Methods» more  TKDE 2012»
13 years 1 months ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
KBSE
2005
IEEE
15 years 4 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
CVPR
2005
IEEE
16 years 29 days ago
3D Geometric and Optical Modeling of Warped Document Images from Scanners
When one scans a document page from a thick bound volume, the curvature of the page to be scanned results in two kinds of distortion in the scanned document images: i) shade along...
Li Zhang, Zheng Zhang 0003, Chew Lim Tan, Tao Xia
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
16 years 9 days ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh