4843 search results - page 312 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
133
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
123
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
142
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
157
click to vote
KDD
1999
ACM
15 years 8 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...