Sciweavers

2621 search results - page 201 / 525
» Near orders and codes
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 6 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CASES
2005
ACM
15 years 8 months ago
Anomalous path detection with hardware support
Embedded systems are being deployed as a part of critical infrastructures and are vulnerable to malicious attacks due to internet accessibility. Intrusion detection systems have b...
Tao Zhang, Xiaotong Zhuang, Santosh Pande, Wenke L...
GLOBECOM
2008
IEEE
16 years 1 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras
BMCBI
2006
145views more  BMCBI 2006»
15 years 6 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
CODES
2008
IEEE
16 years 1 months ago
Holistic design and caching in mobile computing
We utilize application trends analysis, focused on webpage content, in order to examine the design of mobile computers more holistically. We find that both Internet bandwidth and ...
Mwaffaq Otoom, JoAnn M. Paul