1029 search results - page 77 / 206 » Probabilistic Recurrence Relations |
121
Voted
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign l...
191
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
117
click to vote
SAFECOMP
2009
Springer
15 years 10 months ago
2009
Springer
A key concern in safety engineering is understanding the overall emergent failure behaviour of a system, i.e., behaviour exhibited by the system that is outside its specification ...
134
click to vote
PKDD
2005
Springer
15 years 9 months ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
120
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...