Sciweavers

10608 search results - page 563 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
15 years 4 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
ICASSP
2011
IEEE
14 years 10 months ago
EM-style optimization of hidden conditional random fields for grapheme-to-phoneme conversion
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ...
Georg Heigold, Stefan Hahn, Patrick Lehnen, Herman...
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
16 years 7 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
16 years 10 days ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng
CONEXT
2008
ACM
15 years 9 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda