Sciweavers

1477 search results - page 88 / 296
» Complexity of (iterated) dominance
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
Fast hierarchical backprojection for helical cone-beam tomography
Existing algorithms for exact helical cone beam (HCB) tomographic reconstruction are computationally infeasible for clinical applications. Their computational cost is dominated by...
Yoram Bresler, Jeffrey Brokish
ISMIR
2003
Springer
116views Music» more  ISMIR 2003»
15 years 11 months ago
Harmonic analysis with probabilistic graphical models
A technique for harmonic analysis is presented that partitions a piece of music into contiguous regions and labels each with the key, mode, and functional chord, e.g. tonic, domin...
Christopher Raphael, Josh Stoddard
OL
2011
277views Neural Networks» more  OL 2011»
15 years 1 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
16 years 3 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
TCS
1998
15 years 6 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...