921 search results - page 179 / 185 » New Data Structures for Orthogonal Range Searching |
CGO
2011
IEEE
13 years 2 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
AAAI
2010
14 years 9 days ago
2010
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
ALMOB
2008
13 years 11 months ago
2008
Background: Experimental identification of microRNA (miRNA) targets is a difficult and time consuming process. As a consequence several computational prediction methods have been ...
WWW
2003
ACM
14 years 11 months ago
2003
ACM
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
WWW
2004
ACM
14 years 11 months ago
2004
ACM
We present a question answering (QA) system which learns how to detect and rank answer passages by analyzing questions and their answers (QA pairs) provided as training data. We b...