4110 search results - page 216 / 822 » Efficient algorithms for the 2-gathering problem |
171
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
269
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
138
click to vote
ROBVIS
2001
Springer
15 years 11 months ago
2001
Springer
This paper presents a wavelet-based algorithm for height from gradients. The tensor product of the third-order Daubechies’ scaling functions is used to span the solution space. ...
180
click to vote
PVLDB
2008
15 years 6 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
163
click to vote
ICRA
1999
IEEE
15 years 10 months ago
1999
IEEE
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...