Sciweavers

1396 search results - page 151 / 280
» Succinct Dynamic Data Structures
Sort
View
CONPAR
1992
15 years 5 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
APAQS
2001
IEEE
15 years 5 months ago
Object-Oriented Program Behavior Analysis Based on Control Patterns
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
C.-C. Hwang, S.-K. Huang, D.-J. Chen, D. Chen
CSE
2009
IEEE
15 years 4 months ago
Analyzing Enterprise Social Media Networks
Broadening adoption of social media applications within the enterprise offers a new and valuable data source for insight into the social structure of organizations. Social media ap...
Marc A. Smith, Derek L. Hansen, Eric Gleave
TCBB
2008
108views more  TCBB 2008»
15 years 29 days ago
Statistical Characterization of Protein Ensembles
When accounting for structural fluctuations or measurement errors, a single rigid structure may not be sufficient to represent a protein. One approach to solve this problem is to r...
Diego Rother, Guillermo Sapiro, Vijay Pande
DATESO
2009
101views Database» more  DATESO 2009»
14 years 11 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar