Sciweavers

394 search results - page 75 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
SAC
2008
ACM
14 years 9 months ago
Local linear regression with adaptive orthogonal fitting for the wind power application
For short-term forecasting of wind generation, a necessary step is to model the function for the conversion of meteorological variables (mainly wind speed) to power production. Su...
Pierre Pinson, Henrik Aalborg Nielsen, Henrik Mads...
ICCV
1999
IEEE
15 years 11 months ago
United Snakes
Since their debut in 1987, snakes (active contour models) have become a standard image analysis technique with several variants now in common use. We present a framework called ``...
Jianming Liang, Tim McInerney, Demetri Terzopoulos
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
15 years 9 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
15 years 4 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...