Sciweavers

962 search results - page 67 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
IPPS
1998
IEEE
15 years 2 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
83
Voted
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 9 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
JMM2
2006
212views more  JMM2 2006»
14 years 9 months ago
K-means Tracker: A General Algorithm for Tracking People
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...
Chunsheng Hua, Haiyuan Wu, Qian Chen, Toshikazu Wa...
BMCBI
2004
158views more  BMCBI 2004»
14 years 9 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...
PRL
2010
188views more  PRL 2010»
14 years 4 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...