Sciweavers

3341 search results - page 225 / 669
» On Bounded Queries and Approximation
Sort
View
ECCC
2008
122views more  ECCC 2008»
15 years 6 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
16 years 1 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
VLDB
2001
ACM
115views Database» more  VLDB 2001»
15 years 11 months ago
Dynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Ly...
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 6 months ago
Query Strategies for Evading Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
16 years 24 days ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont