Sciweavers

4541 search results - page 187 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
JSC
2002
74views more  JSC 2002»
15 years 2 months ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
SIGSOFT
1993
ACM
15 years 7 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
15 years 8 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»
16 years 3 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»
15 years 3 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...