Sciweavers

1197 search results - page 173 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CAV
2004
Springer
151views Hardware» more  CAV 2004»
13 years 12 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
JCP
2006
139views more  JCP 2006»
13 years 8 months ago
Generalized Sequential Pattern Mining with Item Intervals
Sequential pattern mining is an important data mining method with broad applications that can extract frequent sequences while maintaining their order. However, it is important to ...
Yu Hirate, Hayato Yamana
CVPR
2010
IEEE
13 years 10 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
SIGMOD
2012
ACM
224views Database» more  SIGMOD 2012»
11 years 10 months ago
Tiresias: the database oracle for how-to queries
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
Alexandra Meliou, Dan Suciu
DAC
2006
ACM
14 years 9 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...