Sciweavers

1857 search results - page 91 / 372
» Minimum Degree Orderings
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
GLVLSI
2003
IEEE
157views VLSI» more  GLVLSI 2003»
15 years 11 months ago
Optimum wire sizing of RLC interconnect with repeaters
Repeaters are often used to drive high impedance interconnects. These lines have become highly inductive and can affect signal behavior. The line inductance should therefore be co...
Magdy A. El-Moursy, Eby G. Friedman
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
16 years 4 hour ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
DCC
2006
IEEE
16 years 6 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis
ICARCV
2006
IEEE
84views Robotics» more  ICARCV 2006»
16 years 14 days ago
On the Form-Closure Capability of Robotic Underactuated Hands
—This paper presents a new method to study the capability of an underactuated hand to produce form-closed grasps. First, the stability behaviours of different underactuated paral...
Vincent Begoc, Claude Durand, Sébastien Kru...