3875 search results - page 410 / 775 » Approximation algorithms for the 0-extension problem |
276
click to vote
CPM
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
185
click to vote
WAOA
2004
Springer
16 years 3 days ago
2004
Springer
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
187
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
176
click to vote
CCCG
2001
15 years 8 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
134
click to vote
NIPS
2003
15 years 8 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...