Sciweavers

20 search results - page 4 / 4
» Perfect hashing as an almost perfect subtype test
Sort
View
FOCS
2005
IEEE
13 years 11 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
LOGCOM
2010
154views more  LOGCOM 2010»
13 years 2 days ago
Collaborative Runtime Verification with Tracematches
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
Eric Bodden, Laurie J. Hendren, Patrick Lam, Ondre...
PRESENCE
2002
119views more  PRESENCE 2002»
13 years 5 months ago
Visual Homing Is Possible Without Landmarks: A Path Integration Study in Virtual Reality
The literature often suggests that proprioceptive and especially vestibular cues are required for navigation and spatial orientation tasks involving rotations of the observer. To ...
Bernhard E. Riecke, Henricus A. H. C. van Veen, He...
BMCBI
2010
109views more  BMCBI 2010»
13 years 5 months ago
ParallABEL: an R library for generalized parallelization of genome-wide association studies
Background: Genome-Wide Association (GWA) analysis is a powerful method for identifying loci associated with complex traits and drug response. Parts of GWA analyses, especially th...
Unitsa Sangket, Surakameth Mahasirimongkol, Wasun ...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 5 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan