Sciweavers

1933 search results - page 221 / 387
» Query Containment Using Views
Sort
View
FUIN
2010
102views more  FUIN 2010»
15 years 22 days ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina
114
Voted
ICDAR
2003
IEEE
15 years 8 months ago
Information Retrieval Based Writer Identification
This communication deals with the Writer Identification task. Our previous work has shown the interest of using the graphemes as features for describing the individual properties ...
Ameur Bensefia, Thierry Paquet, Laurent Heutte
139
Voted
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 9 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
159
Voted
CCS
2007
ACM
15 years 7 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
COMPGEOM
2005
ACM
15 years 5 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