Sciweavers

5114 search results - page 707 / 1023
» Complex networks
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Fast PDA Synchronization Using Characteristic Polynomial Interpolation
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
Ari Trachtenberg, David Starobinski, Sachin Agarwa...
182
Voted
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
15 years 11 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...
ARVLSI
1999
IEEE
162views VLSI» more  ARVLSI 1999»
15 years 11 months ago
Conjunction Search Using a 1-D, Analog VLSI-based, Attentional Search/Tracking Chip
The ability of animals to select a limited region of sensory space for scrutiny is an important factor in dealing with cluttered or complex sensory environments. Such an attention...
Timothy K. Horiuchi, Ernst Niebur
FOCS
1998
IEEE
15 years 11 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
IPPS
1998
IEEE
15 years 11 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky