1158 search results - page 173 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
136
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
161
click to vote
PODC
2006
ACM
16 years 1 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
201
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
176
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
184
click to vote
AAAI
2007
15 years 8 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...