Sciweavers

1089 search results - page 138 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SI3D
1995
ACM
14 years 15 days ago
I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments
: We present an exact and interactive collision detection system, I-COLLIDE, for large-scale environments. Such environments are characterized by the number of objects undergoing r...
Jonathan D. Cohen, Ming C. Lin, Dinesh Manocha, Ma...
AAAI
2008
13 years 11 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
CVPR
2010
IEEE
13 years 11 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 10 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
COCOON
2008
Springer
13 years 10 months ago
Visual Cryptography on Graphs
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
Steve Lu, Daniel Manchala, Rafail Ostrovsky