Sciweavers

2520 search results - page 251 / 504
» The complexity of approximating entropy
Sort
View
INFOCOM
2006
IEEE
16 years 19 days ago
A Statistical Framework for Intrusion Detection in Ad Hoc Networks
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
Dhanant Subhadrabandhu, Saswati Sarkar, Farooq Anj...
AMR
2005
Springer
137views Multimedia» more  AMR 2005»
16 years 4 days ago
Information Retrieval of Sequential Data in Heterogeneous XML Databases
The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing...
Eugen Popovici, Pierre-Francois Marteau, Gildas M&...
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 8 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 8 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
NIPS
2007
15 years 8 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch