Sciweavers

2983 search results - page 12 / 597
» The group marriage problem
Sort
View
JOT
2010
97views more  JOT 2010»
13 years 6 months ago
Towards a theory and calculus of aliasing
A theory, graphical notation, mathematical calculus and implementation for finding whether two given expressions can, at execution time, denote references attached to the same obj...
Bertrand Meyer
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 29 days ago
Improved Combinatorial Group Testing for Real-World Problem Sizes
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
David Eppstein, Michael T. Goodrich, Daniel S. Hir...
ECCV
2010
Springer
12 years 1 months ago
Voting by Grouping Dependent Parts
Hough voting methods efficiently handle the high complexity of multiscale, category-level object detection in cluttered scenes. The primary weakness of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
CLIMA
2010
13 years 7 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
CVPR
2012
IEEE
11 years 10 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...