942 search results - page 141 / 189 » Constraints in Graph Drawing Algorithms |
120
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
108
Voted
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
112
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
110
Voted
ICRA
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
130
Voted
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...