Sciweavers

2925 search results - page 56 / 585
» Information Complexity of Online Problems
Sort
View
AAAI
2010
15 years 7 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
180
Voted
ICML
2010
IEEE
15 years 7 months ago
Detecting Large-Scale System Problems by Mining Console Logs
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many sof...
Wei Xu, Ling Huang, Armando Fox, David Patterson, ...
MST
2008
124views more  MST 2008»
15 years 6 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
CSCW
2011
ACM
15 years 1 months ago
Towards quality discourse in online news comments
With the growth in sociality and interaction around online news media, news sites are increasingly becoming places for communities to discuss and address common issues spurred by ...
Nicholas Diakopoulos, Mor Naaman
NIPS
2008
15 years 7 months ago
Modeling the effects of memory on human online sentence processing with particle filters
Language comprehension in humans is significantly constrained by memory, yet rapid, highly incremental, and capable of utilizing a wide range of contextual information to resolve ...
Roger P. Levy, Florencia Reali, Thomas L. Griffith...