Sciweavers

1941 search results - page 366 / 389
» On the Hardness of Approximate Reasoning
Sort
View
IJWMC
2007
111views more  IJWMC 2007»
14 years 11 months ago
Adaptive semi-soft handoff for Cellular IP networks
—Rapid advances in wireless networking have led to more mobile phones, PDAs, and other digital mobile devices becoming ubiquitously connected to the Internet. As the demand of de...
Eriko Nurvitadhi, Ben Lee, Chansu Yu, Myungchul Ki...
CCR
2005
97views more  CCR 2005»
14 years 11 months ago
On the robustness of router-based denial-of-service (DoS) defense systems
This paper focuses on "router-based" defense mechanisms, and whether they can provide effective solutions to network Denialof-Service (DoS) attacks. Router-based defense...
Ying Xu, Roch Guérin
TSE
2008
107views more  TSE 2008»
14 years 11 months ago
Interface Grammars for Modular Software Model Checking
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
Graham Hughes, Tevfik Bultan
CORR
2002
Springer
102views Education» more  CORR 2002»
14 years 11 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
TIT
2002
98views more  TIT 2002»
14 years 11 months ago
DC-free binary convolutional coding
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
Tadashi Wadayama, A. J. Han Vinck