Sciweavers

1631 search results - page 166 / 327
» Extreme Programming - Back to Basics
Sort
View
MP
2011
14 years 9 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
JMLR
2012
13 years 4 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
157
Voted
JMLR
2012
13 years 4 months ago
Universal Measurement Bounds for Structured Sparse Signal Recovery
Standard compressive sensing results state that to exactly recover an s sparse signal in Rp , one requires O(s · log p) measurements. While this bound is extremely useful in prac...
Nikhil S. Rao, Ben Recht, Robert D. Nowak
DAC
2012
ACM
13 years 4 months ago
Self-aware computing in the Angstrom processor
Addressing the challenges of extreme scale computing requires holistic design of new programming models and systems that support those models. This paper discusses the Angstrom pr...
Henry Hoffmann, Jim Holt, George Kurian, Eric Lau,...
ASPLOS
2009
ACM
16 years 3 months ago
GPU acceleration of a production molecular docking code
Abstract: Modeling the interactions of biological molecules, or docking, is critical to both understanding basic life processes and to designing new drugs. Here we describe the GPU...
Bharat Sukhwani, Martin C. Herbordt