Sciweavers

846 search results - page 139 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 9 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
HLK
2003
IEEE
14 years 2 months ago
Generic Deformable Implicit Mesh Models for Automated Reconstruction
Deformable 3–D models can be represented either as explicit or implicit surfaces. Explicit surfaces, such as triangulations or wire-frame models, are widely accepted in the Comp...
Slobodan Ilic, Pascal Fua
ICCV
2003
IEEE
14 years 2 months ago
Meshfree Particle Method
Many of the computer vision algorithms have been posed in various forms of differential equations, derived from minimization of specific energy functionals, and the finite eleme...
Huafeng Liu, Pengcheng Shi
LATIN
2010
Springer
14 years 1 months ago
Euclidean Prize-Collecting Steiner Forest
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi