Sciweavers

9842 search results - page 1292 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
167
Voted
GECCO
2005
Springer
16 years 29 days ago
Evolving agent swarms for clustering and sorting
Social insect societies consist of individuals with simple behavior, yet at the collective level the societies are capable of solving complex tasks. These tasks span a wide range,...
Vegard Hartmann
ISNN
2005
Springer
16 years 28 days ago
A Block-Adaptive Subspace Method Using Oblique Projections for Blind Separation of Convolutive Mixtures
This paper presents a block-adaptive subspace algorithm via oblique projection for blind source separation (BSS) problem of convolutive mixtures. In the proposed algorithm, the pro...
Chunyi Peng, Xianda Zhang, Qutang Cai
PERVASIVE
2005
Springer
16 years 28 days ago
Parasitic Mobility for Pervasive Sensor Networks
Distributed sensor networks offer many new capabilities for contextually monitoring environments. By making such systems mobile, we increase the application-space for the distribut...
Mathew Laibowitz, Joseph A. Paradiso
VLDB
2005
ACM
86views Database» more  VLDB 2005»
16 years 28 days ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
CSCLP
2005
Springer
16 years 27 days ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
« Prev « First page 1292 / 1969 Last » Next »