Sciweavers

151 search results - page 29 / 31
» Materializing views with minimal size to answer queries
Sort
View
JCB
2007
118views more  JCB 2007»
13 years 8 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
SIGGRAPH
2000
ACM
14 years 23 days ago
Conservative volumetric visibility with occluder fusion
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
Gernot Schaufler, Julie Dorsey, Xavier Déco...
UAI
1997
13 years 9 months ago
Nonuniform Dynamic Discretization in Hybrid Networks
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
Alexander V. Kozlov, Daphne Koller
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 8 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
JMLR
2002
140views more  JMLR 2002»
13 years 8 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