Sciweavers

3630 search results - page 695 / 726
» Fast Marching Methods
Sort
View
SPIRE
2009
Springer
16 years 12 days ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
CISS
2008
IEEE
16 years 11 days ago
Network distribution capacity and content-pipe gap
Abstract— The growth of video content and diversiï¬cation of content-sharing methods in the Internet lead to an exciting range of new problems in networking, communications, and...
Mung Chiang
CISS
2008
IEEE
16 years 11 days ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
GLOBECOM
2008
IEEE
16 years 10 days ago
A Dynamic Load-Balanced Hashing Scheme for Networking Applications
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
N. Sertac Artan, Haowei Yuan, H. Jonathan Chao
INFOCOM
2007
IEEE
16 years 5 days ago
Lexicographic Fairness in WDM Optical Cross-Connects
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of trafï¬c on one or m...
Satya Ranjan Mohanty, Laxmi N. Bhuyan