Sciweavers

158 search results - page 31 / 32
» The Cover Time, the Blanket Time, and the Matthews Bound
Sort
View
ALT
2006
Springer
14 years 2 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
IEEEPACT
1998
IEEE
13 years 10 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
COMSWARE
2007
IEEE
13 years 9 months ago
Efficient Design of End-to-End Probes for Source-Routed Networks
Migration to a converged network has caused service providers to deploy real time applications such as voice over an IP (VoIP) network. From the provider's perspective, the s...
Srinivasan Parthasarathya, Rajeev Rastogi, Marina ...
JUCS
2007
95views more  JUCS 2007»
13 years 5 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
CN
2010
121views more  CN 2010»
13 years 2 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...