Sciweavers

738 search results - page 122 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
15 years 10 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
JAR
2000
145views more  JAR 2000»
14 years 9 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
77
Voted
ICCV
2007
IEEE
15 years 11 months ago
Spherical-Homoscedastic Shapes
Shape analysis requires invariance under translation, scale and rotation. Translation and scale invariance can be realized by normalizing shape vectors with respect to their mean ...
Onur C. Hamsici, Aleix M. Martínez
100
Voted
DAC
2007
ACM
15 years 10 months ago
Period Optimization for Hard Real-time Distributed Automotive Systems
The complexity and physical distribution of modern active-safety automotive applications requires the use of distributed architectures. These architectures consist of multiple ele...
Abhijit Davare, Qi Zhu, Marco Di Natale, Claudio P...
VLDB
1999
ACM
188views Database» more  VLDB 1999»
15 years 1 months ago
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim