Sciweavers

13791 search results - page 2682 / 2759
» Modeling Web Interactions
Sort
View
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 12 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
SIGGRAPH
1993
ACM
13 years 12 months ago
Pad: an alternative approach to the computer interface
We believe that navigation in information spaces is best supported by tapping into our natural spatial and geographic ways of thinking. To this end, we are developing a new comput...
Ken Perlin, David Fox
ANSS
2007
IEEE
13 years 11 months ago
An Accurate and Efficient Time-Division Parallelization of Cycle Accurate Architectural Simulators
This paper proposes a parallel cycle-accurate microarchitectural simulator which efficiently executes its workload by splitting the simulation process along time-axis into many in...
Masahiro Yano, Toru Takasaki, Takashi Nakada, Hiro...
ICDCS
2010
IEEE
13 years 11 months ago
Sentomist: Unveiling Transient Sensor Network Bugs via Symptom Mining
—Wireless Sensor Network (WSN) applications are typically event-driven. While the source codes of these applications may look simple, they are executed with a complicated concurr...
Yangfan Zhou, Xinyu Chen, Michael R. Lyu, Jiangchu...
CSL
2009
Springer
13 years 11 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
« Prev « First page 2682 / 2759 Last » Next »