Sciweavers

3758 search results - page 652 / 752
» A Complete Subsumption Algorithm
Sort
View
EDBT
2008
ACM
167views Database» more  EDBT 2008»
15 years 10 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant
ICS
2010
Tsinghua U.
15 years 7 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 7 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
AVSS
2009
IEEE
15 years 4 months ago
A 3D Face Model for Pose and Illumination Invariant Face Recognition
Generative 3D face models are a powerful tool in computer vision. They provide pose and illumination invariance by modeling the space of 3D faces and the imaging process. The powe...
Pascal Paysan, Reinhard Knothe, Brian Amberg, Sami...
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
15 years 4 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan