Sciweavers

1263 search results - page 195 / 253
» A Scalable Algorithm for Answering Queries Using Views
Sort
View
154
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 5 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
133
Voted
JMLR
2002
140views more  JMLR 2002»
15 years 2 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
130
Voted
VLDB
2007
ACM
149views Database» more  VLDB 2007»
15 years 8 months ago
Probabilistic Skylines on Uncertain Data
Uncertain data are inherent in some important applications. Although a considerable amount of research has been dedicated to modeling uncertain data and answering some types of qu...
Jian Pei, Bin Jiang, Xuemin Lin, Yidong Yuan
IJRR
2008
107views more  IJRR 2008»
15 years 2 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen
HIPC
2007
Springer
15 years 6 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri