Sciweavers

8695 search results - page 305 / 1739
» Making the Complex Simple
Sort
View
190
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Semantics and Evaluation of Top-k Queries in Probabilistic Databases
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
Xi Zhang, Jan Chomicki
IVC
2007
102views more  IVC 2007»
15 years 6 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
VIS
2004
IEEE
114views Visualization» more  VIS 2004»
16 years 8 months ago
Modeling Decomposing Objects under Combustion
We present a simple yet effective method for modeling of object decomposition under combustion. A separate simulation models the flame production and generates heat from a combust...
John Keyser, Zeki Melek
ALT
2002
Springer
16 years 3 months ago
A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
Johannes Fürnkranz
NICSO
2010
Springer
16 years 1 months ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto