Sciweavers

208 search results - page 26 / 42
» A Constraint on the Number of Distinct Vectors with Applicat...
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 5 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
ICRA
2009
IEEE
165views Robotics» more  ICRA 2009»
14 years 2 months ago
Global path planning for robust Visual Servoing in complex environments
Abstract— We incorporate sampling-based global path planning with Visual Servoing (VS) for a robotic arm equipped with an in-hand camera. The path planning accounts for a number ...
Moslem Kazemi, Kamal K. Gupta, Mehran Mehrandezh
DEBS
2008
ACM
13 years 8 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
CGF
1998
86views more  CGF 1998»
13 years 7 months ago
Subdivision Schemes for Thin Plate Splines
Thin plate splines are a well known entity of geometric design. They are defined as the minimizer of a variational problem whose differential operators approximate a simple notio...
Henrik Weimer, Joe D. Warren
ECCV
2004
Springer
14 years 9 months ago
Dimensionality Reduction by Canonical Contextual Correlation Projections
A linear, discriminative, supervised technique for reducing feature vectors extracted from image data to a lower-dimensional representation is proposed. It is derived from classica...
Marco Loog, Bram van Ginneken, Robert P. W. Duin