Sciweavers

1356 search results - page 109 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 9 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
IAJIT
2010
88views more  IAJIT 2010»
13 years 7 months ago
Leader Election Algorithm in 2D Torus Networks with the Presence of One Link Failure
: Leader election algorithms solve the instability problem in the network which is caused by leader failure .In this paper, we propose a new leader election algorithm in two dimens...
Mohammed Refai, Ahmad Sharieh, Fahad Alshammari
AADEBUG
1997
Springer
14 years 1 months ago
Backwards-Compatible Bounds Checking for Arrays and Pointers in C Programs
This paper presents a new approach to enforcing array bounds and pointer checking in the C language. Checking is rigorous in the sense that the result of pointer arithmetic must r...
Richard W. M. Jones, Paul H. J. Kelly
EDBT
2012
ACM
257views Database» more  EDBT 2012»
11 years 11 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
CNSR
2007
IEEE
14 years 3 months ago
Testing Intrusion Detection Systems in MANET: A Comprehensive Study
In this paper, we study the problem of testing Intrusion Detection Systems (IDS) in Mobile Ad hoc Networks (MANET). Testing is achieved by simulating different measurements. We mo...
Hadi Otrok, Joey Paquet, Mourad Debbabi, Prabir Bh...