3471 search results - page 307 / 695 » Obstacle Numbers of Graphs |
158
click to vote
ISAAC
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
284
click to vote
FOCS
1993
IEEE
15 years 11 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
183
click to vote
DAC
2009
ACM
15 years 10 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
164
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
186
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...