565 search results - page 47 / 113 » Colorization by Matrix Completion |
123
click to vote
SIROCCO
2000
15 years 3 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
110
Voted
TCS
2008
15 years 2 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
108
Voted
DISOPT
2010
15 years 2 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
105
click to vote
SOCIALCOM
2010
15 years 5 days ago
2010
: Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various sub...
112
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Two proportionate af ne projection sign algorithms (APSAs) are proposed for system identi cation applications, such as network echo cancellation (NEC), where the impulse response ...