Sciweavers

13987 search results - page 2527 / 2798
» The Two Guards Problem
Sort
View
PPOPP
2011
ACM
14 years 9 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 9 months ago
FlexMin: a flexible tool for automatic bug isolation in DBMS software
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Kristi Morton, Nicolas Bruno
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
14 years 6 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
CBSE
2011
Springer
14 years 6 months ago
Rectifying orphan components using group-failover in distributed real-time and embedded systems
Orphan requests are a significant problem for multi-tier distributed systems since they adversely impact system correctness by violating the exactly-once semantics of application...
Sumant Tambe, Aniruddha S. Gokhale
CIKM
2011
Springer
14 years 6 months ago
Mining entity translations from comparable corpora: a holistic graph mapping approach
This paper addresses the problem of mining named entity translations from comparable corpora, specifically, mining English and Chinese named entity translation. We first observe...
Jinhan Kim, Long Jiang, Seung-won Hwang, Young-In ...
« Prev « First page 2527 / 2798 Last » Next »