Sciweavers

2150 search results - page 323 / 430
» On a restricted cross-intersection problem
Sort
View
100
Voted
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
15 years 2 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
110
Voted
VMV
2008
190views Visualization» more  VMV 2008»
15 years 2 months ago
GPU-Based Streamlines for Surface-Guided 3D Flow Visualization
Visualizing 3D flow fields intrinsically suffers from problems of clutter and occlusion. A common practice to alleviate these issues is to restrict the visualization to feature su...
Markus Üffinger, Thomas Klein, Magnus Strenge...
117
Voted
AUSFORENSICS
2004
15 years 2 months ago
An Analysis and Comparison of Clustered Password Crackers
Password policies alone do not stand a chance of securing computer systems which rely on the use of secretbased, password authentication methods. The enforcement of "strong&q...
Christian Frichot
100
Voted
CAINE
2004
15 years 2 months ago
Adjusting Web Caching Computers to Reduce Communication Channel Allocation
On the Internet, it is common practice to use a computer to provide web caching services. Such services aim to reduce network utilization and improve access time to a web page. Li...
R. Zuck, A. Williams, B. Kair, H. Bui, Catherine S...
BIOCOMP
2006
15 years 2 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer