Sciweavers

1596 search results - page 35 / 320
» Quantum property testing
Sort
View
CCGRID
2006
IEEE
14 years 4 months ago
Grid-User Driven Grid Research, The CoBRA Grid
A new multi-purpose LightWeight Grid system (LWG) is introduced, under the acronym CoBRA grid (Computational Basic Reprogrammable Adaptive grid). It provides the functionality gri...
Peter Hellinckx, Gunther Stuer, Wouter Hendrickx, ...
CDES
2006
99views Hardware» more  CDES 2006»
13 years 11 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
ICALP
2001
Springer
14 years 2 months ago
Testing Hypergraph Coloring
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
Artur Czumaj, Christian Sohler
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 10 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 11 months ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler