Sciweavers

608 search results - page 98 / 122
» Tests, Proofs and Refinements
Sort
View
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 17 hour ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
ICIP
2007
IEEE
16 years 10 days ago
Sound from Gramophone Record Groove Surface Orientation
Preserving historic recording on gramophone records is an important task because the traditional record play back system damages/wears out records eventually. We present an optica...
Baozhong Tian, John L. Barron
ECOOP
2009
Springer
15 years 11 months ago
From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility
Contemporary refactoring tools for JAVA aiding in the restructuring of programs have problems with respecting access modifiers such as public and private: while some tools provide ...
Friedrich Steimann, Andreas Thies
CHI
2008
ACM
15 years 11 months ago
MightyTrace: multiuser tracking technology on lc-displays
In this paper, we present a new technology to perform multi Tangible User Interface (TUI) tracking on standard LCdisplays. A lot of existing technologies for tangible user interfa...
Ramon Hofer, Patrick Kaplan, Andreas Kunz
POPL
2010
ACM
15 years 8 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy