Sciweavers

2430 search results - page 386 / 486
» Computing Tutte Polynomials
Sort
View
GLVLSI
2009
IEEE
131views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Octilinear redistributive routing in bump arrays
This paper proposes a scheme for automatic re-distribution layer (RDL) routing, which is used in chip-package connections. Traditional RDL routing designs are mostly performed man...
Renshen Wang, Chung-Kuan Cheng
ICRA
2009
IEEE
141views Robotics» more  ICRA 2009»
16 years 1 months ago
Detecting repeated motion patterns via Dynamic Programming using motion density
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsu...
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
16 years 1 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
ATAL
2009
Springer
16 years 1 months ago
Manipulation and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
16 years 1 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri