Sciweavers

847 search results - page 133 / 170
» Approximation algorithms for projective clustering
Sort
View
122
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
122
Voted
BIOCOMP
2008
15 years 2 months ago
Prediction of Protein Function Using Graph Container and Message Passing
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
Hongbo Zhou, Qiang Shawn Cheng, Mehdi Zargham
89
Voted
CLUSTER
2008
IEEE
15 years 2 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 21 days ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ICCV
1999
IEEE
15 years 4 months ago
What Can Be Determined from a Full and a Weak Perspective Image?
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
Zhengyou Zhang, P. Anandan, Heung-Yeung Shum