Sciweavers

18090 search results - page 250 / 3618
» Computing by Only Observing
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
CJ
2007
106views more  CJ 2007»
15 years 6 months ago
A Proof of Revised Yahalom Protocol in the Bellare and Rogaway (1993) Model
Although the Yahalom protocol, proposed by Burrows, Abadi, and Needham in 1990, is one of the most prominent key establishment protocols analyzed by researchers from the computer s...
Kim-Kwang Raymond Choo
IJNSEC
2006
77views more  IJNSEC 2006»
15 years 6 months ago
Towards a Secure Copyright Protection Infrastructure for e-Education Material: Principles Learned from Experience
Copyright of e-Education material is valuable. The need for protecting it is prominent. In the past two years, we have developed an infrastructure called e-Course eXchange (eCX ) ...
Joe Cho-Ki Yau, Lucas Chi Kwong Hui, Siu-Ming Yiu,...
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 6 months ago
The source coding game with a cheating switcher
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
Hari Palaiyanur, Cheng Chang, Anant Sahai
ENTCS
2007
119views more  ENTCS 2007»
15 years 6 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva