Sciweavers

5215 search results - page 119 / 1043
» Quantum clustering algorithms
Sort
View
CLUSTER
2007
IEEE
15 years 11 months ago
Dynamic scheduling of multi-processor tasks on clusters of clusters
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Sascha Hunold, Thomas Rauber, Gudula Rünger
ALMOB
2006
109views more  ALMOB 2006»
15 years 4 months ago
A novel functional module detection algorithm for protein-protein interaction networks
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 8 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 9 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
15 years 9 months ago
Unconditionally Secure Key Agreement Protocol
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Cyril Prissette