Sciweavers

6045 search results - page 1089 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
13 years 10 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
NIPS
1998
13 years 10 months ago
Modeling Surround Suppression in V1 Neurons with a Statistically Derived Normalization Model
We examine the statistics of natural monochromatic images decomposed using a multi-scale wavelet basis. Although the coefficients of this representation are nearly decorrelated, t...
Eero P. Simoncelli, Odelia Schwartz
ADHOCNOW
2009
Springer
13 years 10 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
BMCBI
2008
130views more  BMCBI 2008»
13 years 9 months ago
An enhanced partial order curve comparison algorithm and its application to analyzing protein folding trajectories
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
Hong Sun, Hakan Ferhatosmanoglu, Motonori Ota, Yus...
CGF
2007
157views more  CGF 2007»
13 years 9 months ago
Mesh Segmentation via Spectral Embedding and Contour Analysis
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
Rong Liu, Hao Zhang 0002
« Prev « First page 1089 / 1209 Last » Next »