Sciweavers

8728 search results - page 51 / 1746
» On Reduct Construction Algorithms
Sort
View
STOC
1997
ACM
82views Algorithms» more  STOC 1997»
14 years 1 months ago
Reducing the Complexity of Reductions
Manindra Agrawal, Eric Allender, Russell Impagliaz...
MOBIHOC
2003
ACM
14 years 8 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu
DATE
2004
IEEE
106views Hardware» more  DATE 2004»
14 years 19 days ago
Realizable Reduction for Electromagnetically Coupled RLMC Interconnects
This paper presents a realizable RLMC1 reduction algorithm for extracted interconnect circuits based on two effective approaches: RL branch reduction and RC/LC node reduction. Our...
Rong Jiang, Charlie Chung-Ping Chen
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 5 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Xuan-Chao Huang, Jay Cheng
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
14 years 5 months ago
Improved ZDN-arithmetic for Fast Modulo Multiplication
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
Hagen Ploog, Sebastian Flügel, Dirk Timmerman...