376 search results - page 69 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
88
Voted
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
101
click to vote
AINA
2007
IEEE
15 years 3 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
96
Voted
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
109
Voted
VIS
2009
IEEE
15 years 10 months ago
2009
IEEE
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...
83
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...