Sciweavers

828 search results - page 136 / 166
» Bounded Hairpin Completion
Sort
View
VC
2011
106views more  VC 2011»
13 years 4 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
JMLR
2010
147views more  JMLR 2010»
13 years 4 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
JMLR
2010
157views more  JMLR 2010»
13 years 4 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
TWC
2010
13 years 4 months ago
Cellular Systems with Non-Regenerative Relaying and Cooperative Base Stations
In this paper, the performance of cellular networks with joint multicell processing and dedicated relay terminals is investigated. It is assumed that each relay terminal is capable...
Oren Somekh, Osvaldo Simeone, Harold Vincent Poor,...
CORR
2011
Springer
115views Education» more  CORR 2011»
13 years 1 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...