Sciweavers

10051 search results - page 1365 / 2011
» A Dynamic Separator Algorithm
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
Frank Mueller
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
15 years 8 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
BMCBI
2004
158views more  BMCBI 2004»
15 years 7 months ago
Improvement of alignment accuracy utilizing sequentially conserved motifs
Background: Multiple sequence alignment algorithms are very important tools in molecular biology today. Accurate alignment of proteins is central to several areas such as homology...
Saikat Chakrabarti, Nitin Bhardwaj, Prem A. Anand,...
ECCV
2008
Springer
16 years 9 months ago
Floor Fields for Tracking in High Density Crowd Scenes
Abstract. This paper presents an algorithm for tracking individual targets in high density crowd scenes containing hundreds of people. Tracking in such a scene is extremely challen...
Saad Ali, Mubarak Shah
« Prev « First page 1365 / 2011 Last » Next »