Sciweavers

8647 search results - page 13 / 1730
» The Container Selection Problem
Sort
View
CONCUR
2012
Springer
12 years 12 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
ICIP
2005
IEEE
15 years 11 months ago
Off-line multiple object tracking using candidate selection and the Viterbi algorithm
This paper presents a probabilistic framework for off-line multiple object tracking. At each timestep, a small set of deterministic candidates is generated which is guaranteed to ...
Anil C. Kokaram, François Pitié, Roz...
ICRA
1998
IEEE
116views Robotics» more  ICRA 1998»
15 years 1 months ago
Dimensional Analysis and Selective Distortion in Scaled Bilateral Telemanipulation
ThiJ puper addresses the issue of dynamic similarity and intensive property invariance in scaled bilateral naunipulation, and ofsers a design methodology bused on these considerat...
Michael Goldfarb
ICST
2010
IEEE
14 years 8 months ago
Satisfying Test Preconditions through Guided Object Selection
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
Yi Wei, Serge Gebhardt, Bertrand Meyer, Manuel Ori...
55
Voted
SODA
2004
ACM
58views Algorithms» more  SODA 2004»
14 years 11 months ago
Point containment in the integer hull of a polyhedron
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...
Ernst Althaus, Friedrich Eisenbrand, Stefan Funke,...