Sciweavers

4536 search results - page 206 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ISMB
1993
13 years 11 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
SIGSOFT
1993
ACM
14 years 1 months ago
Scalable Software Libraries
1 Many software libraries (e.g., the Booch C++ Components, libg++, NIHCL, COOL) provide components (classes) that implement data structures. Each component is written by hand and r...
Don S. Batory, Vivek Singhal, Marty Sirkin, Jeff T...
ICIP
2002
IEEE
14 years 2 months ago
An iterative algorithm for context selection in adaptive entropy coders
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
Tong Jin, Jacques Vaisey
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 10 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
DCG
2010
289views more  DCG 2010»
13 years 9 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...