Sciweavers

102 search results - page 13 / 21
» Constraint Satisfaction Problems of Bounded Width
Sort
View
VC
2011
106views more  VC 2011»
14 years 4 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
NSDI
2007
14 years 12 months ago
Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
Bernard Wong, Ivan Stoyanov, Emin Gün Sirer
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
15 years 3 months ago
Stable Pushing of Assemblies
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
Jay Bernheisel, Kevin M. Lynch
87
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Utility-based power control for peer-to-peer cognitive radio networks with heterogeneous QoS constraints
Transmit-power control is a critical task in cognitive radio (CR) networks. In the present contribution, adherence to hierarchies between primary and secondary users in a peer-to-...
Nikolaos Gatsis, Antonio G. Marqués, Georgi...
CVPR
2008
IEEE
15 years 11 months ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner