Sciweavers

3305 search results - page 126 / 661
» Can we Rely on SQL
Sort
View
ICASSP
2011
IEEE
13 years 2 months ago
Sliding window greedy RLS for sparse filters
We present a sliding window RLS for sparse filters, based on the greedy least squares algorithm. The algorithm adapts a partial QR factorization with pivoting, using a simplifie...
Alexandru Onose, Bogdan Dumitrescu, Ioan Tabus
ICCV
2011
IEEE
12 years 10 months ago
Are Spatial and Global Constraints Really Necessary for Segmentation?
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
Aurelien Lucchi, Yunpeng Li, Xavier Boix, Kevin Sm...
CALCO
2011
Springer
235views Mathematics» more  CALCO 2011»
12 years 10 months ago
On the Fusion of Coalgebraic Logics
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
Fredrik Dahlqvist, Dirk Pattinson
CVPR
2008
IEEE
15 years 8 days ago
Modeling complex luminance variations for target tracking
Lambert's model is widely used in low level computer vision algorithms such as matching, tracking or optical flow computation for example. However, it is well known that thes...
Éric Marchand, Christophe Collewet
ICSM
2009
IEEE
14 years 4 months ago
Augmenting static source views in IDEs with dynamic metrics
Mainstream IDEs such as Eclipse support developers in managing software projects mainly by offering static views of the source code. Such a static perspective neglects any informa...
David Röthlisberger, Marcel Harry, Alex Villa...