Sciweavers

433 search results - page 54 / 87
» A greedy approximation algorithm for the group Steiner probl...
Sort
View
CIDM
2007
IEEE
14 years 2 months ago
GAIS: A Method for Detecting Interleaved Sequential Patterns from Imperfect Data
— This paper introduces a novel method, GAIS, for detecting interleaved sequential patterns from databases. A case, where data is of low quality and has errors is considered. Pat...
Marja Ruotsalainen, Timo Ala-Kleemola, Ari Visa
ICPP
2008
IEEE
14 years 2 months ago
Fast Source Switching for Gossip-Based Peer-to-Peer Streaming
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
Zhenhua Li, Jiannong Cao, Guihai Chen, Yan Liu
DCOSS
2011
Springer
12 years 8 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
TALG
2010
86views more  TALG 2010»
13 years 6 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
CORR
2008
Springer
189views Education» more  CORR 2008»
13 years 8 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli