Sciweavers

909 search results - page 42 / 182
» On the approximability of some network design problems
Sort
View
99
Voted
SAINT
2003
IEEE
15 years 6 months ago
Problems and Tentative solutions in InternetCAR testing with IPv6
Vehicle environment is a good testbed to investigate Internet mobility technologies. Based on testing of building, protocol implementation details and problems to deploy it will b...
Keisuke Uehara, Hideki Sunahara, Jun Murai
CNSR
2011
IEEE
257views Communications» more  CNSR 2011»
14 years 5 months ago
On Threshold Selection for Principal Component Based Network Anomaly Detection
—Principal component based anomaly detection has emerged as an important statistical tool for network anomaly detection. It works by projecting summary network information onto a...
Petar Djukic, Biswajit Nandy
136
Voted
TEC
2008
135views more  TEC 2008»
15 years 1 months ago
Evolving Output Codes for Multiclass Problems
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
Nicolás García-Pedrajas, Colin Fyfe
GLOBECOM
2007
IEEE
15 years 7 months ago
Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 5 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers