Sciweavers

2254 search results - page 128 / 451
» Computing the minimal covering set
Sort
View
COR
2006
95views more  COR 2006»
15 years 25 days ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
92
Voted
ICML
2006
IEEE
16 years 1 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
207
Voted
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
16 years 1 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
COORDINATION
2004
Springer
15 years 6 months ago
A Lightweight Coordination Middleware for Mobile Computing
This paper presents Limone, a new coordination model that facilitates rapid application development over ad hoc networks consisting of logically mobile agents and physically mobile...
Chien-Liang Fok, Gruia-Catalin Roman, Gregory Hack...
117
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Sparse common spatial patterns in brain computer interface applications
The Common Spatial Pattern (CSP) method is a powerful technique for feature extraction from multichannel neural activity and widely used in brain computer interface (BCI) applicat...
Fikri Goksu, Nuri Firat Ince, Ahmed H. Tewfik