Sciweavers

151 search results - page 17 / 31
» Requirements for a Practical Network Event Recognition Langu...
Sort
View
JMLR
2010
192views more  JMLR 2010»
13 years 2 months ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
MOZ
2004
Springer
14 years 1 months ago
The Structure of Authority: Why Security Is Not a Separable Concern
Common programming practice grants excess authority for the sake of functionality; programming principles require least authority for the sake of security. If we practice our princ...
Mark S. Miller, Bill Tulloh, Jonathan S. Shapiro
PARELEC
2002
IEEE
14 years 17 days ago
Dynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
Pawel Czarnul
IS
2011
12 years 11 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
WIDM
1999
ACM
13 years 12 months ago
An Efficient Plan Execution System for Information Management Agents
Recent work on information integration has yielded novel and efficient solutions for gathering data from the World Wide Web. However, there has been little attention given to the ...
Greg Barish, Dan DiPasquo, Craig A. Knoblock, Stev...