Sciweavers

3630 search results - page 210 / 726
» Fast Marching Methods
Sort
View
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
15 years 8 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
15 years 8 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri
EMNLP
2007
15 years 8 months ago
Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
Ivan Titov, James Henderson
NIPS
2001
15 years 7 months ago
Fast, Large-Scale Transformation-Invariant Clustering
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
Brendan J. Frey, Nebojsa Jojic
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 6 months ago
A Fast Approach to Creative Telescoping
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that e...
Christoph Koutschan