Sciweavers

831 search results - page 1 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
IAT
2008
IEEE
13 years 11 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 4 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
MICS
2010
137views more  MICS 2010»
13 years 3 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
HICSS
2010
IEEE
224views Biometrics» more  HICSS 2010»
13 years 11 months ago
Finding Success in Rapid Collaborative Requirements Negotiation Using Wiki and Shaper
Defining requirements without satisfying success critical stakeholders often leads to expensive project failures. Enabling interdisciplinary stakeholders to rapidly and effectivel...
Di Wu, Da Yang, Barry W. Boehm
MDM
2010
Springer
152views Communications» more  MDM 2010»
13 years 9 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He