Sciweavers

253 search results - page 35 / 51
» Probabilistic Alert Correlation
Sort
View
SAC
2006
ACM
15 years 3 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
76
Voted
NAACL
2001
14 years 11 months ago
A Corpus-based Account of Regular Polysemy: The Case of Context-sensitive Adjectives
In this paper we investigate polysemous adjectives whose meaning varies depending on the nouns they modify (e.g., fast). We acquire the meanings of these adjectives from a large c...
Maria Lapata
HICSS
2010
IEEE
258views Biometrics» more  HICSS 2010»
14 years 9 months ago
An Empirical Comparison of Four Text Mining Methods
The amount of textual data that is available for researchers and businesses to analyze is increasing at a dramatic rate. This reality has led IS researchers to investigate various...
Sangno Lee, Jeff Baker, Jaeki Song, James C. Wethe...
MVA
2008
140views Computer Vision» more  MVA 2008»
14 years 9 months ago
An occlusion metric for selecting robust camera configurations
Vision based tracking systems for surveillance and motion capture rely on a set of cameras to sense the environment. The exact placement or configuration of these cameras can have...
Xing Chen, James Davis
CPC
2002
80views more  CPC 2002»
14 years 9 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger