648 search results - page 41 / 130 » A general dimension for query learning |
KDD
2010
ACM
14 years 25 days ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
IJCAI
2007
13 years 10 months ago
2007
Most existing sketch understanding systems require a closed domain to achieve recognition. This paper describes an incremental learning technique for opendomain recognition. Our s...
ITICSE
2006
ACM
14 years 2 months ago
2006
ACM
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...