1941 search results - page 373 / 389 » On the Hardness of Approximate Reasoning |
155
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
97
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
106
click to vote
SIGUCCS
2006
ACM
15 years 3 months ago
2006
ACM
In this paper we present the results of an experiment made with our e-librarian service ”MatES”, an e-Learning tool on fractions in mathematics. MatES allows students to enter...
100
click to vote
SASN
2004
ACM
15 years 3 months ago
2004
ACM
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
SIGGRAPH
1990
ACM
15 years 1 months ago
1990
ACM
not abstract asymmetry: different sides looks different clumps different from "data objects" need grid structure, alignment [Design Guidelines for Landmarks to Support Na...