9 search results - page 1 / 2 » Small Space Representations for Metric Min-Sum k -Clustering... |
SIGMOD
2002
ACM
14 years 4 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper we present how to estimate a continuous space Language Model with a Neural Network to be used in a Statistical Machine Translation system. We report results for an I...
CPM
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
ALENEX
2004
13 years 6 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...