Sciweavers

1612 search results - page 178 / 323
» Asynchronous Pattern Matching
Sort
View
149
Voted
JGAA
2007
135views more  JGAA 2007»
15 years 2 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
138
Voted
OOPSLA
2010
Springer
15 years 14 days ago
A recommender for conflict resolution support in optimistic model versioning
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
Petra Brosch, Martina Seidl, Gerti Kappel
167
Voted
TOG
2012
184views Communications» more  TOG 2012»
13 years 5 months ago
Point sampling with general noise spectrum
Point samples with different spectral noise properties (often defined using color names such as white, blue, green, and red) are important for many science and engineering discip...
Yahan Zhou, Haibin Huang, Li-Yi Wei, Rui Wang
115
Voted
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 2 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 2 months ago
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
—Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading r...
Yingbin Liang, Venugopal V. Veeravalli, H. Vincent...