Sciweavers

1569 search results - page 71 / 314
» Programming contest strategy
Sort
View
CVPR
2008
IEEE
15 years 8 hour ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
ISSRE
2003
IEEE
14 years 3 months ago
A New Software Testing Approach Based on Domain Analysis of Specifications and Programs
Partition testing is a well-known software testing technique. This paper shows that partition testing strategies are relatively ineffective in detecting faults related to small sh...
Ruilian Zhao, Michael R. Lyu, Yinghua Min
IPPS
2002
IEEE
14 years 2 months ago
Toward a Framework for Preparing and Executing Adaptive Grid Programs
This paper describes the program execution framework being developed by the Grid Application Development Software (GrADS) Project. The goal of this framework is to provide good re...
Ken Kennedy, Mark Mazina, John M. Mellor-Crummey, ...
CP
2009
Springer
14 years 10 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
JMLR
2012
12 years 13 days ago
Active Clustering of Biological Sequences
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...