232 search results - page 25 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
SEKE
2001
Springer
13 years 11 months ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
NIPS
2003
13 years 8 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...