Sciweavers

195 search results - page 6 / 39
» Cluster-based find and replace
Sort
View
WCRE
1995
IEEE
13 years 10 months ago
On Finding Duplication and Near-Duplication in Large Software Systems
This paper describes how a program called dup can be used to locate instances of duplication or nearduplication in a software system. D u p reports both textually identical sectio...
Brenda S. Baker
SIGIR
1998
ACM
13 years 11 months ago
Web Document Clustering: A Feasibility Demonstration
Users of Web search engines are often forced to sift through the long ordered list of document “snippets” returned by the engines. The IR community has explored document cluste...
Oren Zamir, Oren Etzioni
AAAI
1993
13 years 8 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
SIGGRAPH
2010
ACM
13 years 11 months ago
RepFinder: Finding Approximately Repeated Scene Elements for Image Editing
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...
Ming-Ming Cheng, Fang-Lue Zhang, Niloy J. Mitra, X...
JCP
2008
133views more  JCP 2008»
13 years 6 months ago
DDSC : A Density Differentiated Spatial Clustering Technique
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
Bhogeswar Borah, Dhruba K. Bhattacharyya