563 search results - page 61 / 113 » Computing approximate PSD factorizations |
137
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
130
Voted
ECCV
2004
Springer
16 years 4 months ago
2004
Springer
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
152
click to vote
SPAA
1999
ACM
15 years 6 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
138
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
152
click to vote
FOCS
2010
IEEE
15 years 8 days ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...