Sciweavers

308 search results - page 19 / 62
» How Fast Is the k-Means Method
Sort
View
TIT
2008
74views more  TIT 2008»
15 years 3 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz
ICCV
2009
IEEE
15 years 1 months ago
Non-iterative approach for fast and accurate vanishing point detection
We present an algorithm that quickly and accurately estimates vanishing points in images of man-made environments. Contrary to previously proposed solutions, ours is neither itera...
Jean-Philippe Tardif
130
Voted
ICASSP
2010
IEEE
15 years 3 months ago
High frame rate Motion Compensated Frame Interpolation in High-Definition video processing
Numerous MCFI methods have been proposed to increase the frame rate in the past ten years. However, these methods usually focus on how to double the frame rate and involve complex...
Yen-Lin Lee, Truong Nguyen
96
Voted
ICASSP
2007
IEEE
15 years 10 months ago
Fast Line-Based Imaging of Small Sample Features
This project aims to reduce the time required to attain more detailed scans of small interesting regions present in a quick first-pass sample image. In particular, we concentrate...
Mark A. Iwen, Gurjit S. Mandair, Michael D. Morris...
143
Voted
BMCBI
2006
143views more  BMCBI 2006»
15 years 3 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...