1363 search results - page 257 / 273 » The road coloring problem |
83
Voted
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
103
click to vote
ICASSP
2007
IEEE
15 years 4 months ago
2007
IEEE
Many content-based image retrieval applications suffer from small sample set and high dimensionality problems. Relevance feedback is often used to alleviate those problems. In thi...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
SENSYS
2006
ACM
15 years 3 months ago
2006
ACM
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...