Sciweavers

2698 search results - page 322 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 6 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
EVOW
2009
Springer
15 years 10 months ago
A Hierarchical Classification Ant Colony Algorithm for Predicting Gene Ontology Terms
Abstract. This paper proposes a novel Ant Colony Optimisation algorithm for the hierarchical problem of predicting protein functions using the Gene Ontology (GO). The GO structure ...
Fernando E. B. Otero, Alex Alves Freitas, Colin G....
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 12 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
SPAA
2009
ACM
16 years 1 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
ICALP
2011
Springer
14 years 10 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge