Sciweavers

2208 search results - page 191 / 442
» Memory Practices in the Sciences
Sort
View
TON
2008
125views more  TON 2008»
14 years 10 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
CG
2002
Springer
14 years 10 months ago
PDS-PN: A New Proof-Number Search Algorithm
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaa...
BMVC
2010
14 years 8 months ago
Evaluation of dimensionality reduction methods for image auto-annotation
Image auto-annotation is a challenging task in computer vision. The goal of this task is to predict multiple words for generic images automatically. Recent state-of-theart methods...
Hideki Nakayama, Tatsuya Harada, Yasuo Kuniyoshi
TCOM
2010
98views more  TCOM 2010»
14 years 5 months ago
Convolutionally Coded Transmission over Markov-Gaussian Channels: Analysis and Decoding Metrics
It has been widely acknowledged that the aggregate interference at the receiver for various practical communication channels can often deviate markedly from the classical additive ...
Jeebak Mitra, Lutz H.-J. Lampe
PLDI
2011
ACM
14 years 1 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík