Sciweavers

892 search results - page 28 / 179
» An efficient terminal and model order reduction algorithm
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
TWC
2008
129views more  TWC 2008»
13 years 9 months ago
Amplify-and-forward cooperation under interference-limited spatial reuse of the relay slot
1 . Cooperative transmission has emerged as an effective tool to deal with channel impairments. In this work we study the applicability of amplify-and-forward cooperative transmiss...
Adrian Agustin, Josep Vidal
SENSYS
2005
ACM
14 years 2 months ago
Estimating clock uncertainty for efficient duty-cycling in sensor networks
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
Saurabh Ganeriwal, Deepak Ganesan, Hohyun Shim, Vl...
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 7 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 26 days ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...