Sciweavers

1888 search results - page 238 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
KDD
1997
ACM
111views Data Mining» more  KDD 1997»
14 years 1 months ago
SIPping from the Data Firehose
When mining large databases, the data extraction problem and the interface between the database and data mining algorithm become important issues. Rather than giving a mining algo...
George H. John, Brian Lent
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 9 months ago
Mining the space of graph properties
Existing data mining algorithms on graphs look for nodes satisfying specific properties, such as specific notions of structural similarity or specific measures of link-based impor...
Glen Jeh, Jennifer Widom
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 3 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
INFOCOM
2002
IEEE
14 years 2 months ago
Probabilistic Location and Routing
Abstract—We propose probabilistic location to enhance the performance of existing peer-to-peer location mechanisms in the case where a replica for the queried data item exists cl...
Sean C. Rhea, John Kubiatowicz
IJCGA
2000
85views more  IJCGA 2000»
13 years 9 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal