Sciweavers

1826 search results - page 355 / 366
» Using Random Forests in the Structured Language Model
Sort
View
IEICET
2006
108views more  IEICET 2006»
13 years 8 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
PVLDB
2008
182views more  PVLDB 2008»
13 years 8 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
FUIN
2008
108views more  FUIN 2008»
13 years 7 months ago
Learning Ground CP-Logic Theories by Leveraging Bayesian Network Learning Techniques
Causal relations are present in many application domains. Causal Probabilistic Logic (CP-logic) is a probabilistic modeling language that is especially designed to express such rel...
Wannes Meert, Jan Struyf, Hendrik Blockeel
ICDT
2009
ACM
130views Database» more  ICDT 2009»
14 years 9 months ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...
AI
2007
Springer
13 years 8 months ago
Learning, detection and representation of multi-agent events in videos
In this paper, we model multi-agent events in terms of a temporally varying sequence of sub-events, and propose a novel approach for learning, detecting and representing events in...
Asaad Hakeem, Mubarak Shah