3443 search results - page 455 / 689 » More Algebras for Determiners |
168
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
171
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
184
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Detecting outliers which are grossly different from or inconsistent with the remaining dataset is a major challenge in real-world KDD applications. Existing outlier detection met...
171
click to vote
SBMF
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
158
Voted
CCS
2001
ACM
15 years 11 months ago
2001
ACM
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the ...