Sciweavers

114 search results - page 14 / 23
» Connected substructure similarity search
Sort
View
WWW
2003
ACM
14 years 9 months ago
Detecting Near-replicas on the Web by Content and Hyperlink Analysis
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...
Ernesto Di Iorio, Michelangelo Diligenti, Marco Go...
ERCIMDL
2009
Springer
225views Education» more  ERCIMDL 2009»
14 years 3 months ago
Demonstration of User Interfaces for Querying in 3D Architectural Content in PROBADO3D
Abstract. The PROBADO project is a research effort to develop Digital Library support for non-textual documents. The main goal is to contribute to all parts of the Digital Library...
René Bernd, Ina Blümel, Harald Krottma...
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 9 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
CIDM
2007
IEEE
14 years 2 months ago
Mining Subspace Correlations
— In recent applications of clustering such as gene expression microarray analysis, collaborative filtering, and web mining, object similarity is no longer measured by physical ...
Rave Harpaz, Robert M. Haralick
CPAIOR
2010
Springer
13 years 6 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey