Sciweavers

4850 search results - page 838 / 970
» Approximate Data Structures with Applications
Sort
View
SIGUCCS
2003
ACM
15 years 3 months ago
Achieving rapid service deployment in an academic environment
Rapid product or service deployment is most commonly thought of in the corporate, rather than academic, environment. Utilizing a rapid deployment process and a number of highly de...
Shea Nangle
ICCS
2001
Springer
15 years 2 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
AAAI
2010
14 years 11 months ago
Informed Lifting for Message-Passing
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
Kristian Kersting, Youssef El Massaoudi, Fabian Ha...
NIPS
2004
14 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
BMCBI
2006
100views more  BMCBI 2006»
14 years 10 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong