1141 search results - page 101 / 229 » Experiences and directions in pushpin computing |
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
AAAI
2007
15 years 8 days ago
2007
The goal of information extraction is to extract database records from text or semi-structured sources. Traditionally, information extraction proceeds by first segmenting each ca...
102
click to vote
AAAI
2008
15 years 8 days ago
2008
Fisher score and Laplacian score are two popular feature selection algorithms, both of which belong to the general graph-based feature selection framework. In this framework, a fe...
AIPS
2007
15 years 8 days ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
AAAI
2008
15 years 8 days ago
2008
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...