Sciweavers

1964 search results - page 309 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
JAIR
2007
95views more  JAIR 2007»
15 years 6 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
TSMC
1998
82views more  TSMC 1998»
15 years 5 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
TSMC
2008
148views more  TSMC 2008»
15 years 5 months ago
Stratification Approach for 3-D Euclidean Reconstruction of Nonrigid Objects From Uncalibrated Image Sequences
Abstract--This paper addresses the problem of 3-D reconstruction of nonrigid objects from uncalibrated image sequences. Under the assumption of affine camera and that the nonrigid ...
Guanghui Wang, Q. M. Jonathan Wu
CIKM
2010
Springer
15 years 1 months ago
On bootstrapping recommender systems
Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more a...
Nadav Golbandi, Yehuda Koren, Ronny Lempel