Sciweavers

624 search results - page 90 / 125
» Mutant Query Plans
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 4 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
VLDB
2005
ACM
85views Database» more  VLDB 2005»
14 years 3 months ago
Pattern Tree Algebras: Sets or Sequences?
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
Stelios Paparizos, H. V. Jagadish
DAGM
2006
Springer
14 years 1 months ago
Handling Camera Movement Constraints in Reinforcement Learning Based Active Object Recognition
In real world scenes, objects to be classified are usually not visible from every direction, since they are almost always positioned on some kind of opaque plane. When moving a cam...
Christian Derichs, Heinrich Niemann
JUCS
2008
196views more  JUCS 2008»
13 years 9 months ago
Information Integration for the Masses
Abstract: Information integration applications combine data from heterogeneous sources to assist the user in solving repetitive data-intensive tasks. Currently, such applications r...
Jim Blythe, Dipsy Kapoor, Craig A. Knoblock, Krist...
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
14 years 11 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom