Sciweavers

1491 search results - page 251 / 299
» Training Linear Discriminant Analysis in Linear Time
Sort
View
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
14 years 9 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 2 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
GLVLSI
2003
IEEE
146views VLSI» more  GLVLSI 2003»
14 years 2 months ago
A practical CAD technique for reducing power/ground noise in DSM circuits
One of the fundamental problems in Deep Sub Micron (DSM) circuits is Simultaneous Switching Noise (SSN), which causes voltage fluctuations in the circuit power/ground networks. In...
Arindam Mukherjee, Krishna Reddy Dusety, Rajsaktis...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 10 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
MTA
2007
141views more  MTA 2007»
13 years 8 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...