Sciweavers

3677 search results - page 705 / 736
» Is a probabilistic modeling
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
QEST
2010
IEEE
13 years 5 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
DATE
2008
IEEE
145views Hardware» more  DATE 2008»
14 years 2 months ago
Minimizing Virtual Channel Buffer for Routers in On-chip Communication Architectures
We present a novel methodology for design space exploration using a two-steps scheme to optimize the number of virtual channel buffers (buffers take the premier share of the route...
Mohammad Abdullah Al Faruque, Jörg Henkel
MICCAI
2006
Springer
14 years 8 months ago
A Learning Based Algorithm for Automatic Extraction of the Cortical Sulci
This paper presents a learning based method for automatic extraction of the major cortical sulci from MRI volumes or extracted surfaces. Instead of using a few pre-defined rules su...
Songfeng Zheng, Zhuowen Tu, Alan L. Yuille, Allan ...
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 7 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...