563 search results - page 36 / 113 » Computing approximate PSD factorizations |
106
Voted
STOC
2010
ACM
15 years 12 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
139
Voted
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
228
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
155
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
120
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...