601 search results - page 95 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
116
click to vote
MOBIHOC
2000
ACM
15 years 5 months ago
2000
ACM
— We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. We addres...
139
click to vote
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
118
click to vote
IWANN
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Ubiquitous computing research have extended traditional environments in the so–called Intelligent Environments. All of them use their capabilities for pursuing their in...
129
click to vote
NIPS
2007
15 years 2 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
103
click to vote
EMNLP
2010
14 years 11 months ago
2010
Most coreference resolution models determine if two mentions are coreferent using a single function over a set of constraints or features. This approach can lead to incorrect deci...