Sciweavers

3946 search results - page 293 / 790
» The computational complexity of choice sets
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 5 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...
ICMCS
2005
IEEE
124views Multimedia» more  ICMCS 2005»
16 years 11 days ago
Fast inter frame encoding based on modes pre-decision in H.264
The new video coding standard, H.264 allows motion estimation performing on tree-structured block partitioning and multiple reference frames. This feature improves the prediction ...
Dongming Zhang, Yanfei Shen, Shouxun Lin, Yongdong...
TNN
2008
182views more  TNN 2008»
15 years 6 months ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
ICASSP
2009
IEEE
16 years 1 months ago
Identification of neurons participating in cell assemblies
Chances to detect assembly activity are expected to increase if the spiking activities of large numbers of neurons are recorded simultaneously. Although such massively parallel re...
Sonja Grün, Denise Berger, Christian Borgelt
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
16 years 25 days ago
ASIP design and synthesis for non linear filtering in image processing
This paper presents an Application Specific Instruction Set Processor (ASIP) design for the implementation of a class of nonlinear image processing algorithms, the Retinex-like fi...
Luca Fanucci, Michele Cassiano, Sergio Saponara, D...