Sciweavers

5100 search results - page 686 / 1020
» The Linear Complexity of a Graph
Sort
View
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
16 years 1 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
CPAIOR
2009
Springer
16 years 1 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
ECMDAFA
2009
Springer
109views Hardware» more  ECMDAFA 2009»
16 years 1 months ago
Uniform Random Generation of Huge Metamodel Instances
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalabilit...
Alix Mougenot, Alexis Darrasse, Xavier Blanc, Mich...
NANONET
2009
Springer
200views Chemistry» more  NANONET 2009»
16 years 1 months ago
Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
A new approach for inserting repeaters in 3-D interconnects is proposed. The allocation of repeaters along an interplane interconnect is iteratively determined. The proposed approa...
Hu Xu, Vasilis F. Pavlidis, Giovanni De Micheli
FGR
2008
IEEE
142views Biometrics» more  FGR 2008»
16 years 1 months ago
Deformable Face Fitting with Soft Correspondence Constraints
Despite significant progress in deformable model fitting over the last decade, the problem of efficient and accurate person-independentface fitting remains a challenging probl...
Jason M. Saragih, Simon Lucey, Jeffrey F. Cohn