1697 search results - page 133 / 340 » On Bayesian Case Matching |
EJC
2000
15 years 15 days ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
87
Voted
SIGECOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
81
Voted
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
204
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
In this paper, we present a stream-based mining algorithm for online anomaly prediction. Many real-world applications such as data stream analysis requires continuous cluster opera...
121
Voted
ICWN
2008
15 years 2 months ago
2008
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...