Sciweavers

3082 search results - page 349 / 617
» New Bounds for the Controller Problem
Sort
View
CORR
1998
Springer
105views Education» more  CORR 1998»
15 years 6 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
TCAD
2002
128views more  TCAD 2002»
15 years 6 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
ML
2007
ACM
131views Machine Learning» more  ML 2007»
15 years 6 months ago
A primal-dual perspective of online learning algorithms
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
Shai Shalev-Shwartz, Yoram Singer
ICPR
2010
IEEE
15 years 5 months ago
Incremental Training of Multiclass Support Vector Machines
We present a new method for the incremental training of multiclass Support Vector Machines that provides computational efficiency for training problems in the case where the trai...
Symeon Nikitidis, Nikos Nikolaidis, Ioannis Pitas
ICCAD
2010
IEEE
176views Hardware» more  ICCAD 2010»
15 years 4 months ago
An auction based pre-processing technique to determine detour in global routing
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
Yue Xu, Chris Chu