Sciweavers

327 search results - page 8 / 66
» A fully dynamic algorithm for planar
Sort
View
DAC
2009
ACM
14 years 8 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
IROS
2006
IEEE
137views Robotics» more  IROS 2006»
14 years 1 months ago
A Development of a Fully Self-contained Real-time Tunable Spring
— Traditionally, robot control has been done typically by “highly precise control algorithms”: the position of each movable body part is accurately determined at any time wit...
Takuya Umedachi, Akio Ishiguro
ICALP
2003
Springer
14 years 27 days ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
RSA
2008
123views more  RSA 2008»
13 years 7 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ICMCS
2006
IEEE
155views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Fully and Semi-Automatic Music Sports Video Composition
Video composition is important for music video production. In this paper we propose an automatic method to assist the music sports video composition operation. Our approach is bas...
Jinjun Wang, Engsiong Chng, Changsheng Xu