Sciweavers

1929 search results - page 267 / 386
» An Approach to Limit the Wynot Problem
Sort
View
EUROSYS
2011
ACM
13 years 12 days ago
Striking a new balance between program instrumentation and debugging time
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
Olivier Crameri, Ricardo Bianchini, Willy Zwaenepo...
IPMI
2011
Springer
13 years 10 days ago
Fast Brain Matching with Spectral Correspondence
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
Herve Lombaert, Leo Grady, Jonathan R. Polimeni, F...
PPOPP
2011
ACM
12 years 11 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...
KDD
2012
ACM
220views Data Mining» more  KDD 2012»
11 years 11 months ago
ComSoc: adaptive transfer of user behaviors over composite social network
Accurate prediction of user behaviors is important for many social media applications, including social marketing, personalization and recommendation, etc. A major challenge lies ...
ErHeng Zhong, Wei Fan, Junwei Wang, Lei Xiao, Yong...
ICCAD
2003
IEEE
219views Hardware» more  ICCAD 2003»
14 years 5 months ago
A Min-Cost Flow Based Detailed Router for FPGAs
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
Seokjin Lee, Yongseok Cheon, Martin D. F. Wong