Sciweavers

620 search results - page 63 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
LCN
2007
IEEE
15 years 6 months ago
A Scalable Hybrid Approach to Switching in Metro Ethernet Networks
—The most common technology in Local Area Networks is the Ethernet protocol. The continuing evolution of Ethernet has propelled it into the scope of Metropolitan Area Networks. E...
Minh Huynh, Prasant Mohapatra
SACRYPT
1998
Springer
129views Cryptology» more  SACRYPT 1998»
15 years 4 months ago
An Accurate Evaluation of Maurer's Universal Test
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
Jean-Sébastien Coron, David Naccache
WSCG
2004
141views more  WSCG 2004»
15 years 1 months ago
Efficient Generation of Triangle Strips from Triangulated Meshes
This paper presents a fast algorithm for generating triangle strips from triangulated meshes, providing a compact representation suitable for transmission and rendering of the mod...
Oliver Matias van Kaick, Murilo Vicente Gonç...
ICASSP
2010
IEEE
15 years 1 days ago
Total-variation regularization with bound constraints
We present a new algorithm for bound-constrained totalvariation (TV) regularization that in comparison with its predecessors is simple, fast, and flexible. We use a splitting app...
Rick Chartrand, Brendt Wohlberg
TIT
2008
61views more  TIT 2008»
14 years 11 months ago
A Probabilistic Upper Bound on Differential Entropy
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
Erik G. Learned-Miller, Joseph DeStefano