18306 search results - page 413 / 3662 » Algorithmics in Exponential Time |
185
click to vote
CCCG
2007
15 years 9 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
202
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
186
click to vote
IEEESCC
2009
IEEE
16 years 2 months ago
2009
IEEE
Finding relevant files in a personal file system continues to be a challenge. It is still easier to find stuff on the Web with its exponential growth than in one’s personal ...
197
Voted
COCO
2010
Springer
15 years 11 months ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
203
click to vote
COLT
2008
Springer
15 years 9 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...