Sciweavers

1814 search results - page 81 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ICALP
2009
Springer
16 years 6 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
BMCBI
2006
152views more  BMCBI 2006»
15 years 6 months ago
A two-stage approach for improved prediction of residue contact maps
Background: Protein topology representations such as residue contact maps are an important intermediate step towards ab initio prediction of protein structure. Although improvemen...
Alessandro Vullo, Ian Walsh, Gianluca Pollastri
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
17 years 17 days ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 6 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CEC
2009
IEEE
15 years 10 months ago
Benchmarking and solving dynamic constrained problems
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Trung Thanh Nguyen, Xin Yao