Sciweavers

350 search results - page 16 / 70
» Separation of Partition Inequalities
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Local Graph Partitioning using PageRank Vectors
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Distributed Streaming via Packet Partitioning
We propose a system for adaptive streaming from multiple servers to a single receiver over separate network paths. Based on incoming packets, the receiver estimates the available ...
Jacob Chakareski, Pascal Frossard
MP
2010
145views more  MP 2010»
13 years 6 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
ICRA
1999
IEEE
96views Robotics» more  ICRA 1999»
14 years 5 days ago
Interactive Manipulation of Articulated Objects with Geometry Awareness
Techniques for interactive 3D manipulation of articulated objects in cluttered environments should be geometricallyaware, going beyond basic inverse or forward kinematics to allow...
Min-Hyung Choi, James F. Cremer
ICALP
1998
Springer
14 years 3 days ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof