Sciweavers

3894 search results - page 384 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
FOCM
2007
76views more  FOCM 2007»
15 years 5 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
245
Voted
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
15 years 10 months ago
A Computational Model for RNA Multiple Structural Alignment.
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...
Eugene Davydov, Serafim Batzoglou
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
15 years 10 months ago
Better Bounds for Minimizing SONET ADMs
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...
Leah Epstein, Asaf Levin
CAAN
2006
Springer
15 years 8 months ago
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
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...
Guy Even, Shimon Shahar
CCCG
2001
15 years 6 months ago
Translational polygon covering using intersection graphs
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 ...
Karen Daniels, Rajasekhar Inkulu