Sciweavers

5595 search results - page 403 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
WWW
2003
ACM
16 years 7 months ago
Web Sessions Clustering with Artificial Ants Colonies
In this paper, we apply AntClust, an ant based clustering algorithm, to the Web usage-mining problem. We define a Web session as a weighted multi-modal vector and we propose an ad...
Gilles Venturini, Nicolas Labroche, Nicolas Monmar...
ICDM
2008
IEEE
90views Data Mining» more  ICDM 2008»
16 years 1 months ago
Finding Alternative Clusterings Using Constraints
1 The aim of data mining is to find novel and actionable insights. However, most algorithms typically just find a single explanation of the data even though alternatives could e...
Ian Davidson, Zijie Qi
ICPP
2005
IEEE
16 years 12 days ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
15 years 10 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 11 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail