Sciweavers

973 search results - page 23 / 195
» New Bounds on Crossing Numbers
Sort
View
IAJIT
2011
12 years 11 months ago
On the genus of pancake network
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
Quan T. Nguyen, Saïd Bettayeb
FSE
2007
Springer
263views Cryptology» more  FSE 2007»
14 years 1 months ago
Bad and Good Ways of Post-processing Biased Physical Random Numbers
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing rando...
Markus Dichtl
ICIP
2006
IEEE
14 years 9 months ago
Improved Unsymmetric-Cross Multi-Hexagon-Grid Search Algorithm for Fast Block Motion Estimation
We develop a set of new motion estimation (ME) algorithms based mainly on Unsymmetric-Cross Multi-Hexagon-Grid Search (UMH). The original algorithms are improved by applying the S...
Janne Heikkilä, Tuukka Toivonen
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 1 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
CIKM
2009
Springer
14 years 1 days ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...