Sciweavers

4114 search results - page 399 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Scalable training of L1-regularized log-linear models
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
Galen Andrew, Jianfeng Gao
IROS
2007
IEEE
107views Robotics» more  IROS 2007»
16 years 1 months ago
Scheduling for humans in multirobot supervisory control
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...
Sandra Mau, John M. Dolan
CVPR
2006
IEEE
16 years 8 months ago
Hierarchical Procrustes Matching for Shape Retrieval
We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching algorithm which avoids problems associated with purely global or local methods and performs wel...
Graham McNeill, Sethu Vijayakumar
HIPEAC
2010
Springer
16 years 3 months ago
Performance and Power Aware CMP Thread Allocation Modeling
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
Yaniv Ben-Itzhak, Israel Cidon, Avinoam Kolodny
172
Voted
IPPS
2002
IEEE
15 years 11 months ago
Parallel Genehunter: Implementation of a Linkage Analysis Package for Distributed-Memory Architectures
We present a parallel algorithm for performing multipoint linkage analysis of genetic marker data on large family pedigrees. The algorithm effectively distributes both the computa...
Gavin C. Conant, Steve Plimpton, William Old, Andr...