Sciweavers

777 search results - page 33 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
13 years 6 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 7 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
ASPDAC
2006
ACM
101views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Worst case execution time analysis for synthesized hardware
- We propose a hardware performance estimation flow for fast design space exploration, based on worst-case execution time analysis algorithms for software analysis. Test cases on s...
Jun-hee Yoo, Xingguang Feng, Kiyoung Choi, Eui-You...
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
RECOMB
2006
Springer
14 years 7 months ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...