6251 search results - page 181 / 1251 » Randomness, Computability, and Density |
149
click to vote
MST
2010
15 years 2 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
147
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We address the problem of parameter estimation in presence
of both uncertainty and outlier noise. This is a common
occurrence in computer vision: feature localization
is perform...
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Future computing systems will feature many cores that run fast, but might show more faults compared to existing CMOS technologies. New software methodologies must be adopted to ...
129
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
151
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...