10608 search results - page 79 / 2122 » Complexity of O'Hara's Algorithm |
136
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
143
click to vote
OPODIS
2008
15 years 5 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
160
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
128
click to vote
DISOPT
2010
15 years 4 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...
117
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...