1538 search results - page 148 / 308 » Spectral Techniques in Graph Algorithms |
164
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
172
click to vote
ICDAR
2011
IEEE
14 years 3 months ago
2011
IEEE
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
134
click to vote
ACSD
2004
IEEE
15 years 7 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
131
click to vote
ACSD
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
118
click to vote
SIROCCO
2008
15 years 5 months ago
2008
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...