Sciweavers

60 search results - page 10 / 12
» An Optimal Parallel Algorithm for Learning DFA
Sort
View
97
Voted
FCT
2009
Springer
15 years 4 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
FSS
2010
147views more  FSS 2010»
14 years 8 months ago
A divide and conquer method for learning large Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz
83
Voted
CADE
2006
Springer
15 years 9 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
DCOSS
2008
Springer
14 years 11 months ago
Efficient Node Discovery in Mobile Wireless Sensor Networks
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
Vladimir Dyo, Cecilia Mascolo
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
15 years 10 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny