Sciweavers

1494 search results - page 153 / 299
» Less Extreme Programming
Sort
View
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 13 days ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
15 years 11 months ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
15 years 9 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
IWPC
2008
IEEE
15 years 9 months ago
Identifying Word Relations in Software: A Comparative Study of Semantic Similarity Tools
Modern software systems are typically large and complex, making comprehension of these systems extremely difficult. Experienced programmers comprehend code by seamlessly processi...
Giriprasad Sridhara, Emily Hill, Lori L. Pollock, ...
RTCSA
2008
IEEE
15 years 9 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...