Sciweavers

1161 search results - page 123 / 233
» Approximation schemes for clustering problems
Sort
View
ICIP
2010
IEEE
13 years 7 months ago
Multi-stream partitioning and parity rate allocation for scalable IPTV delivery
We address the joint problem of clustering heterogenous clients and allocating scalable video source rate and FEC redundancy in IPTV systems. We propose a streaming solution that ...
Jacob Chakareski, Pascal Frossard
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
14 years 3 months ago
Game Theoretic Control for Robot Teams
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
CIKM
2009
Springer
14 years 4 months ago
Fast and effective histogram construction
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
14 years 1 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
ICCSA
2004
Springer
14 years 3 months ago
Semantic Completeness in Sub-ontology Extraction Using Distributed Methods
The use of ontologies lies at the very heart of the newly emerging era of Semantic Web. They provide a shared conceptualization of some domain that may be communicated between peop...
Mehul Bhatt, Carlo Wouters, Andrew Flahive, J. Wen...