Sciweavers

15 search results - page 3 / 3
» The Moore Bound for Irregular Graphs
Sort
View
SCOPES
2004
Springer
14 years 27 days ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
13 years 12 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
INFOCOM
2012
IEEE
11 years 10 months ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...
GIS
2004
ACM
14 years 8 months ago
A new approach for a topographic feature-based characterization of digital elevation data
Triangular Irregular Network (TIN) and Regular Square Grid (RSG) are widely used for representing 2.5 dimensional spatial data. However, these models are not defined from the topo...
Eric Saux, Ki-Joune Li, Min-Hwan Kim, Rémy ...
SPAA
2010
ACM
14 years 11 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...