706 search results - page 108 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
We study in this paper the Web forum crawling problem, which is a very fundamental step in many Web applications, such as search engine and Web data mining. As a typical user-crea...
EDBT
2004
ACM
14 years 9 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
WINET
2002
13 years 8 months ago
2002
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...