Sciweavers

69 search results - page 5 / 14
» A New Distance Algorithm and Its Application to General Forc...
Sort
View
POPL
2007
ACM
14 years 7 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
WWW
2004
ACM
14 years 8 months ago
Automatic web news extraction using tree edit distance
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant infor...
Davi de Castro Reis, Paulo Braz Golgher, Altigran ...
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
14 years 8 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
CP
2008
Springer
13 years 9 months ago
Approximate Compilation of Constraints into Multivalued Decision Diagrams
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
Tarik Hadzic, John N. Hooker, Barry O'Sullivan, Pe...
JCST
2008
124views more  JCST 2008»
13 years 7 months ago
Clustering by Pattern Similarity
The task of clustering is to identify classes of similar objects among a set of objects. The definition of similarity varies from one clustering model to another. However, in most ...
Haixun Wang, Jian Pei