5022 search results - page 583 / 1005 » Data structures and problem solving using Java |
157
click to vote
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
154
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...
137
click to vote
STOC
2003
ACM
16 years 4 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 ...
140
click to vote
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
150
click to vote
AAAI
1996
15 years 5 months ago
1996
One issue involved in accessing multiple heterogeneous information sources is how to integrate the retrieved data. SIMS, an information mediator, handles this problem by mapping t...