Sciweavers

13 search results - page 2 / 3
» PDM Sorting Algorithms That Take A Small Number of Passes
Sort
View
KAIS
2006
126views more  KAIS 2006»
13 years 5 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
IPPS
2009
IEEE
14 years 2 days ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
VLDB
1998
ACM
105views Database» more  VLDB 1998»
13 years 9 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 3 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
ROBOCUP
2007
Springer
106views Robotics» more  ROBOCUP 2007»
13 years 11 months ago
Beyond Frontier Exploration
This article investigates the prerequisites for a global exploration strategy in an unknown environment on a virtual disaster site. Assume that a robot equipped with a laser range...
Arnoud Visser, Xingrui-Ji, Merlijn van Ittersum, L...