Sciweavers

8196 search results - page 456 / 1640
» Computational Modeling and Complexity Science
Sort
View
201
Voted
DAC
2009
ACM
16 years 7 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...
285
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
193
Voted
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
ECAI
2008
Springer
15 years 8 months ago
Theoretical and Computational Properties of Preference-based Argumentation
During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
197
Voted
IJCV
2006
227views more  IJCV 2006»
15 years 6 months ago
A Multigrid Platform for Real-Time Motion Computation with Discontinuity-Preserving Variational Methods
Variational methods are among the most accurate techniques for estimating the optic flow. They yield dense flow fields and can be designed such that they preserve discontinuities, ...
Andrés Bruhn, Joachim Weickert, Timo Kohlbe...