Sciweavers

393 search results - page 52 / 79
» The LCA Problem Revisited
Sort
View
129
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Near-field adaptive beamforming and source localization in the spacetime frequency domain
We revisit the topics of near-field adaptive beamforming and source localization following an alternative approach based on a spatiotemporal spectral representation of the acoust...
Francisco Pinto, Martin Vetterli
102
Voted
DLOG
2010
14 years 12 months ago
Optimal Rewritings in Definitorially Complete Description Logics
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...
126
Voted
JMLR
2010
118views more  JMLR 2010»
14 years 8 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
FOCS
2006
IEEE
15 years 8 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
ICIP
2009
IEEE
16 years 2 months ago
Polar Snakes: A Fast And Robust Parametric Active Contour Model
We present in this paper a way to perform a fast and robust image segmentation and to track a contour along a sequence of images. Our approach is based on a dynamic deformable mod...