Sciweavers

12194 search results - page 2389 / 2439
» Numberings Optimal for Learning
Sort
View
VLDB
1998
ACM
192views Database» more  VLDB 1998»
15 years 4 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng
SPAA
1997
ACM
15 years 4 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
94
Voted
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 4 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
104
Voted
ICALP
1992
Springer
15 years 4 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
161
Voted
SPAA
1993
ACM
15 years 4 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
« Prev « First page 2389 / 2439 Last » Next »