Sciweavers

10608 search results - page 1911 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
DISOPT
2011
240views Education» more  DISOPT 2011»
15 years 10 days ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 9 days ago
Reed Muller Sensing Matrices and the LASSO
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
A. Robert Calderbank, Sina Jafarpour
PAMI
2011
15 years 9 days ago
Decoupled Active Contour (DAC) for Boundary Detection
— The accurate detection of object boundaries via active contours is an ongoing research topic in computer vision. Most active contours converge towards some desired contour by m...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
174
Voted
PPNA
2011
15 years 9 days ago
Evaluation framework for adaptive context-aware routing in large scale mobile peer-to-peer systems
The proliferation of novel wireless network technologies creates new opportunities for complex peerto-peer information dissemination systems. A key challenge that remains in this a...
Ansar-Ul-Haque Yasar, Davy Preuveneers, Yolande Be...
RTS
2011
123views more  RTS 2011»
15 years 9 days ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
« Prev « First page 1911 / 2122 Last » Next »