Sciweavers

16430 search results - page 927 / 3286
» On Computable Tree Functions
Sort
View
TIT
2008
123views more  TIT 2008»
15 years 7 months ago
Geometric Upper Bounds on Rates of Variable-Basis Approximation
In this paper, approximation by linear combinations of an increasing number n of computational units with adjustable parameters (such as perceptrons and radial basis functions) is ...
Vera Kurková, Marcello Sanguineti
DSN
2000
IEEE
16 years 3 days ago
Exploiting Non-Determinism for Reliability of Mobile Agent Systems
An important technical hurdle blocking the adoption of mobile agent technology is the lack of reliability. Designing a reliable mobile agent system is especially challenging since...
Ajay Mohindra, Apratim Purakayastha, Prasannaa Tha...
ICALP
2009
Springer
16 years 8 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
WSNA
2003
ACM
16 years 29 days ago
Lightweight time synchronization for sensor networks
This paper presents lightweight tree-based synchronization (LTS) methods for sensor networks. First, a single-hop, pair-wise synchronization scheme is analyzed. This scheme requir...
Jana van Greunen, Jan M. Rabaey
JMLR
2006
132views more  JMLR 2006»
15 years 7 months ago
Learning to Detect and Classify Malicious Executables in the Wild
We describe the use of machine learning and data mining to detect and classify malicious executables as they appear in the wild. We gathered 1,971 benign and 1,651 malicious execu...
Jeremy Z. Kolter, Marcus A. Maloof