7648 search results - page 1108 / 1530 » A Data Locality Optimizing Algorithm |
137
click to vote
ACL
2004
15 years 6 months ago
2004
Exploiting unannotated natural language data is hard largely because unsupervised parameter estimation is hard. We describe deterministic annealing (Rose et al., 1990) as an appea...
116
click to vote
SOSP
1997
ACM
15 years 6 months ago
1997
ACM
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
123
click to vote
DAGSTUHL
1993
15 years 6 months ago
1993
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...
148
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
The structure of a Markov network is typically learned using top-down search. At each step, the search specializes a feature by conjoining it to the variable or feature that most ...
146
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...