Sciweavers

980 search results - page 157 / 196
» A Sequential Reduction Strategy
Sort
View
PDCN
2004
14 years 11 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
ICFP
2010
ACM
14 years 10 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
CORR
2010
Springer
122views Education» more  CORR 2010»
14 years 9 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
JMLR
2006
85views more  JMLR 2006»
14 years 9 months ago
Streamwise Feature Selection
In streamwise feature selection, new features are sequentially considered for addition to a predictive model. When the space of potential features is large, streamwise feature sel...
Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H...
ICCV
2007
IEEE
15 years 11 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas