Sciweavers

414 search results - page 42 / 83
» On discrete norms of polynomials
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
13 years 8 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 10 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
APN
2005
Springer
14 years 3 months ago
Continuization of Timed Petri Nets: From Performance Evaluation to Observation and Control
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
Manuel Silva, Laura Recalde
SIAMNUM
2011
144views more  SIAMNUM 2011»
13 years 4 months ago
Continuous Mesh Framework Part II: Validations and Applications
This paper gives a numerical validation of the continuous mesh framework introduced in Part I [23]. We numerically show that the interpolation error can be evaluated analytically o...
Adrien Loseille, Frédéric Alauzet
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 6 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller