Sciweavers

185 search results - page 6 / 37
» Property Testing with Geometric Queries
Sort
View
ECCC
2008
122views more  ECCC 2008»
13 years 7 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
AIPR
2004
IEEE
13 years 11 months ago
An Image Retrieval System Using Multispectral Random Field Models, Color, and Geometric Features
This paper describes a novel color texture-based image retrieval system for the query of an image database to find similar images to a target image. The retrieval process involves...
Orlando J. Hernandez, Alireza Khotanzad
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
13 years 9 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
ICSE
2005
IEEE-ACM
14 years 7 months ago
Testing database transactions with AGENDA
AGENDA is a tool set for testing relational database applications. An earlier prototype was targeted to applications consisting of a single query and included components for popul...
Yuetang Deng, Phyllis G. Frankl, David Chays