3133 search results - page 257 / 627 » Representing clusters for retrieval |
160
click to vote
ISCAPDCS
2004
15 years 8 months ago
2004
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
188
click to vote
TASLP
2008
15 years 6 months ago
2008
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
154
click to vote
TCAD
2008
15 years 6 months ago
2008
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
175
click to vote
TREC
1994
15 years 8 months ago
1994
: This paper describes an approach to information retrieval based on a syntactic analysis of the document texts and user queries, and from that analysis, the construction of tree s...
203
Voted
NIPS
2001
15 years 8 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...