Sciweavers

42230 search results - page 149 / 8446
» Algorithms and Complexity Results for
Sort
View
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
15 years 3 months ago
A multi-objective algorithm for DS-CDMA code design based on the clonal selection principle
This paper proposes a new algorithm based on the clonal selection principle for the design of spreading codes for DS-CDMA. The algorithm follows a multi-objective approach, genera...
Daniel Stevens, Sanjoy Das, Balasubramaniam Natara...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 3 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
DATESO
2009
101views Database» more  DATESO 2009»
14 years 7 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
IJFCS
2006
63views more  IJFCS 2006»
14 years 10 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
CIKM
2004
Springer
15 years 3 months ago
Soft clustering criterion functions for partitional document clustering: a summary of results
Recently published studies have shown that partitional clustering algorithms that optimize certain criterion functions, which measure key aspects of inter- and intra-cluster simil...
Ying Zhao, George Karypis