Sciweavers

3466 search results - page 49 / 694
» Fast computation of special resultants
Sort
View
ICDCS
2012
IEEE
12 years 1 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
FOCS
2008
IEEE
14 years 5 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
TOG
2008
120views more  TOG 2008»
13 years 11 months ago
Real-time, all-frequency shadows in dynamic scenes
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
Thomas Annen, Zhao Dong, Tom Mertens, Philippe Bek...
ISCA
2006
IEEE
92views Hardware» more  ISCA 2006»
13 years 11 months ago
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
Darshan D. Thaker, Tzvetan S. Metodi, Andrew W. Cr...
ARC
2007
Springer
118views Hardware» more  ARC 2007»
14 years 3 months ago
Simulation of the Dynamic Behavior of One-Dimensional Cellular Automata Using Reconfigurable Computing
This paper presents the implementation of an environment for the evolution of one-dimensional cellular automata using a reconfigurable logic device. This configware is aimed at eva...
Wagner Rodrigo Weinert, César Manuel Vargas...