Sciweavers

775 search results - page 5 / 155
» Map Labeling and Its Generalizations
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
ISPD
2004
ACM
92views Hardware» more  ISPD 2004»
14 years 26 days ago
A predictive distributed congestion metric and its application to technology mapping
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
Rupesh S. Shelar, Sachin S. Sapatnekar, Prashant S...
ICNP
1998
IEEE
13 years 11 months ago
A Definition of General Weighted Fairness and its Support in Explicit Rate Switch Algorithms
In this paper we give a general definition of weighted fairness and discuss how a pricing policy can be mapped to general weighted (GW) fairness. The GW fairness can be achieved b...
Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goya...
CGA
2006
13 years 7 months ago
MapShaper.org: A Map Generalization Web Service
: Despite recent advances in map-generalization tools and theories, this work has been slow to find its way into the hands of the map-making public. Mapshaper.org is a free-touse g...
Mark Harrower, Matt Bloch
SAC
2010
ACM
13 years 2 months ago
Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...