Sciweavers

1328 search results - page 159 / 266
» An Optimization Algorithm for the Ordered Open-End Bin-Packi...
Sort
View
ICML
2007
IEEE
14 years 9 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
ISCAPDCS
2004
13 years 10 months ago
Heuristics-Based Replication Schemas for Fast Information Retrieval over the Internet
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
Samee Ullah Khan, Ishfaq Ahmad
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 9 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
IAT
2009
IEEE
13 years 6 months ago
A Multi-agent Resource Negotiation for Social Welfare
This study seeks to provide scalable and distributed algorithms to solve the resource allocation problem within an agent community. We propose an approach that can be applied to a...
Antoine Nongaillard, Philippe Mathieu
CVPR
2010
IEEE
14 years 5 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler