Sciweavers

5658 search results - page 25 / 1132
» An Efficient Counting Network
Sort
View
DAC
1996
ACM
14 years 2 months ago
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
Nguyen-Ngoc Bình, Masaharu Imai, Akichika S...
ALGOSENSORS
2008
Springer
13 years 12 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
JCIT
2008
138views more  JCIT 2008»
13 years 9 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
CONEXT
2009
ACM
13 years 11 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
SI3D
1999
ACM
14 years 2 months ago
Preprocessing occlusion for real-time selective refinement
Visibility computation and level of detail modeling are two important components of efficient scenerendering algorithms. Both aim to lessen the graphics load by lowering polygon c...
Fei-Ah Law, Tiow Seng Tan