Sciweavers

5624 search results - page 40 / 1125
» On Conditional Covering Problem
Sort
View
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 2 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
CVPR
2010
IEEE
15 years 10 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
NIPS
2003
15 years 3 months ago
Margin Maximizing Loss Functions
Margin maximizing properties play an important role in the analysis of classi£cation models, such as boosting and support vector machines. Margin maximization is theoretically in...
Saharon Rosset, Ji Zhu, Trevor Hastie
MCS
2006
Springer
15 years 2 months ago
Criteria for mixed grids in computational fluid dynamics
The finite volume method is used as a numerical method for solving the fluid flow equations. This method is appropriate to employ under structured and unstructured meshes. Mixed g...
Erwin Doescher, Haroldo F. de Campos Velho, Fernan...
TCS
2008
15 years 2 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...