Sciweavers

573 search results - page 54 / 115
» Lighting Networks - A New Approach for Designing Lighting Al...
Sort
View
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
14 years 8 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman
ILP
2007
Springer
14 years 1 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
WIKIS
2005
ACM
14 years 1 months ago
Wiki communities in the context of work processes
In this article we examine the integration of communities of practice supported by a wiki into work processes. Linear structures are often inappropriate for the execution of knowl...
Frank Fuchs-Kittowski, André Köhler
JMLR
2010
184views more  JMLR 2010»
13 years 2 months ago
Sequential Monte Carlo Samplers for Dirichlet Process Mixtures
In this paper, we develop a novel online algorithm based on the Sequential Monte Carlo (SMC) samplers framework for posterior inference in Dirichlet Process Mixtures (DPM) (DelMor...
Yener Ülker, Bilge Günsel, Ali Taylan Ce...
MOBIDE
2006
ACM
14 years 1 months ago
Towards correcting input data errors probabilistically using integrity constraints
Mobile and pervasive applications frequently rely on devices such as RFID antennas or sensors (light, temperature, motion) to provide them information about the physical world. Th...
Nodira Khoussainova, Magdalena Balazinska, Dan Suc...