Sciweavers

698 search results - page 63 / 140
» Fast functional simulation using branching programs
Sort
View
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 1 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
CVIU
2011
14 years 5 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
IDMS
2000
Springer
128views Multimedia» more  IDMS 2000»
15 years 5 months ago
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
JCC
2006
82views more  JCC 2006»
15 years 1 months ago
Monte Carlo simulations of biomolecules: The MC module in CHARMM
: We describe the implementation of a general and flexible Monte Carlo (MC) module for the program CHARMM, which is used widely for modeling biomolecular systems with empirical ene...
Jie Hu, Ao Ma, Aaron R. Dinner
HASKELL
2009
ACM
15 years 8 months ago
Roll your own test bed for embedded real-time protocols: a haskell experience
We present by example a new application domain for functional languages: emulators for embedded real-time protocols. As a casestudy, we implement a simple emulator for the Biphase...
Lee Pike, Geoffrey M. Brown, Alwyn Goodloe