Sciweavers

1617 search results - page 154 / 324
» Constraints in Weighted Averaging
Sort
View
101
Voted
NAACL
2010
14 years 10 months ago
Minimally-Supervised Extraction of Entities from Text Advertisements
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
Sameer Singh, Dustin Hillard, Chris Leggetter
103
Voted
TVCG
2011
120views more  TVCG 2011»
14 years 7 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
90
Voted
HPCA
2009
IEEE
16 years 1 months ago
Blueshift: Designing processors for timing speculation from the ground up
Several recent processor designs have proposed to enhance performance by increasing the clock frequency to the point where timing faults occur, and by adding error-correcting supp...
Brian Greskamp, Lu Wan, Ulya R. Karpuzcu, Jeffrey ...
119
Voted
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 7 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
INFOCOM
2006
IEEE
15 years 6 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel