776 search results - page 22 / 156 » Generalized Voxel Coloring |
142
Voted
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
101
Voted
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
— As an extension of our previous work on estimating fingertip forces by imaging the fingernail [13], the dynamic features of the coloration response of different parts of the ...
122
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
108
Voted
ICIP
2004
IEEE
16 years 3 months ago
2004
IEEE
Content based shape image retrieval is an important problem which gained the attention of the community. The challenge is to map the shape into compact and robust descriptor. This...
121
click to vote
FUN
2010
Springer
15 years 6 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...