16921 search results - page 3046 / 3385 » Information Technology |
186
click to vote
LATIN
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
165
click to vote
LATIN
2004
Springer
16 years 5 days ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
164
click to vote
LATIN
2004
Springer
16 years 5 days ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
184
click to vote
VLDB
2004
ACM
16 years 4 days ago
2004
ACM
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
183
click to vote
DISCEX
2003
IEEE
16 years 3 days ago
2003
IEEE
We introduce a technique for detecting anomalous patterns in a categorical feature (one that takes values from a finite alphabet). It differs from most anomaly detection methods u...