Sciweavers

5244 search results - page 56 / 1049
» When are two algorithms the same
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Scalable reader-writer locks
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
Yossi Lev, Victor Luchangco, Marek Olszewski
ECAI
2010
Springer
13 years 8 months ago
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...
Xiaowei Huang, Ron van der Meyden
DM
2010
131views more  DM 2010»
13 years 7 months ago
On a construction of graphs with high chromatic capacity and large girth
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
Bing Zhou
TCBB
2010
104views more  TCBB 2010»
13 years 6 months ago
Fast Hinge Detection Algorithms for Flexible Protein Structures
— Analysis of conformational changes is one of the keys to the understanding of protein functions and interactions. For the analysis, we often compare two protein structures, tak...
Tetsuo Shibuya
SEKE
2007
Springer
14 years 1 months ago
A Semantical Change Detection Algorithm for XML
XML diff algorithms proposed in the literature have focused on the structural analysis of the document. When XML is used for data exchange, or when different versions of a documen...
Rodrigo Cordeirodos Santos, Carmem S. Hara