Sciweavers

765 search results - page 148 / 153
» Graph Coloring with Rejection
Sort
View
SOCIALCOM
2010
13 years 6 months ago
The Dynamics of Two Cognitive Heuristics for Coordination on Networks
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
Iyad Rahwan, Fatemeh Jahedpari, Sherief Abdallah
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 3 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
TIP
2010
129views more  TIP 2010»
13 years 3 months ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...
TIT
2010
174views Education» more  TIT 2010»
13 years 3 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 9 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...