4075 search results - page 569 / 815 » Modeling Distributed Algorithm Using B |
171
click to vote
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
16 years 3 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
199
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
177
click to vote
HPDC
2007
IEEE
16 years 29 days ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
156
click to vote
CIS
2007
Springer
16 years 24 days ago
2007
Springer
—Real-world data mining deals with noisy information sources where data collection inaccuracy, device limitations, data transmission and discretization errors, or man-made pertur...
171
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
Cloud computing has emerged as a new approach to large scale computing and is attracting a lot of attention from the scientific and research computing communities. Despite its gro...