Sciweavers

2031 search results - page 186 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
PODC
2010
ACM
15 years 2 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
PODC
2010
ACM
15 years 2 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang
AOSD
2007
ACM
15 years 2 months ago
Performance improvement for persistent systems by AOP
Efficient data retrieval from databases is a significant issue of the design of persistent systems. We propose an aspect oriented persistent system named AspectualStore. Aspectual...
Yasuhiro Aoki, Shigeru Chiba
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
15 years 2 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
CIKM
2006
Springer
15 years 2 months ago
Re-ranking search results using query logs
This work addresses two common problems in search, frequently occurring with underspecified user queries: the top-ranked results for such queries may not contain documents relevan...
Ziming Zhuang, Silviu Cucerzan