4536 search results - page 555 / 908 » Contention-Sensitive Data Structures and Algorithms |
170
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
When modeling high-dimensional richly structured data, it is often the case that the distribution defined by the Deep Boltzmann Machine (DBM) has a rough energy landscape with man...
178
click to vote
TCS
2008
15 years 6 months ago
2008
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
192
Voted
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
184
click to vote
ESA
2003
Springer
16 years 4 hour ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
180
click to vote
IJRR
2007
15 years 6 months ago
2007
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...