Sciweavers

4106 search results - page 253 / 822
» A Computational Model for Metric Spaces
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
WMCSA
2002
IEEE
15 years 11 months ago
Context Aggregation and Dissemination in Ubiquitous Computing Systems
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
Guanling Chen, David Kotz
AAAI
1996
15 years 8 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
WCE
2007
15 years 7 months ago
Procedures of Parameters' estimation of AR(1) models into lineal state-space models
—The objective of this paper is to study how algorithms of optimization affect the parametersestimation of Autoregressive AR(1)Models. In our research we have represented the AR...
Rouhia Noomene
SIGGRAPH
2000
ACM
15 years 10 months ago
Accessible animation and customizable graphics via simplicial configuration modeling
Our goal is to embed free-form constraints into a graphical model. With such constraints a graphic can maintain its visual integrity--and break rules tastefully--while being manip...
Tom Ngo, Doug Cutrell, Jenny Dana, Bruce Randall D...