Sciweavers

567 search results - page 12 / 114
» Similarity Search Using Multiple Examples in MARS
Sort
View
WWW
2008
ACM
16 years 3 months ago
Web graph similarity for anomaly detection (poster)
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
Panagiotis Papadimitriou 0002, Ali Dasdan, Hector ...
145
Voted
JUCS
2000
91views more  JUCS 2000»
15 years 2 months ago
Syntax, Parsing and Production of Natural Language in a Framework of Information Compression by Multiple Alignment, Unification
This article introduces the idea that information compression by multiple alignment, unification and search (ICMAUS) provides a framework within which natural language syntax may ...
J. Gerard Wolff
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 2 months ago
Canonicalization of database records using adaptive similarity measures
It is becoming increasingly common to construct databases from information automatically culled from many heterogeneous sources. For example, a research publication database can b...
Aron Culotta, Michael L. Wick, Robert Hall, Matthe...
178
Voted
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
13 years 4 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
IMA
2007
Springer
97views Cryptology» more  IMA 2007»
15 years 8 months ago
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
Juan M. Estévez-Tapiador, John A. Clark, Ju...