Sciweavers

1629 search results - page 231 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
15 years 10 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
TSP
2008
178views more  TSP 2008»
14 years 9 months ago
Monte Carlo Methods for Channel, Phase Noise, and Frequency Offset Estimation With Unknown Noise Variances in OFDM Systems
In this paper, we address the problem of orthogonal frequency-division multiplexing (OFDM) channel estimation in the presence of phase noise (PHN) and carrier frequency offset (CFO...
F. Septier, Yves Delignon, A. Menhaj-Rivenq, Chris...
SIGSOFT
2003
ACM
15 years 10 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
TVLSI
2008
169views more  TVLSI 2008»
14 years 9 months ago
Energy-Aware Flash Memory Management in Virtual Memory System
The traditional virtual memory system is designed for decades assuming a magnetic disk as the secondary storage. Recently, flash memory becomes a popular storage alternative for ma...
Han-Lin Li, Chia-Lin Yang, Hung-Wei Tseng
ICTAI
2010
IEEE
14 years 7 months ago
A New Filtering Based on Decomposition of Constraint Sub-Networks
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...
Philippe Jégou, Cyril Terrioux