263 search results - page 20 / 53 » Minimum Entropy Coloring |
PERCOM
2007
ACM
15 years 11 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
100
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
DAC
1999
ACM
16 years 23 days ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
127
click to vote
PCM
2004
Springer
15 years 5 months ago
2004
Springer
The layered depth image (LDI) is a popular approach to represent three-dimensional objects with complex geometry for image-based rendering (IBR). LDI contains several attribute val...
103
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...