Sciweavers

2424 search results - page 177 / 485
» A general algorithm for data dependence analysis
Sort
View
132
Voted
RECOMB
2003
Springer
16 years 3 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
158
Voted
DAGSTUHL
2007
15 years 5 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
150
Voted
ECCV
2010
Springer
15 years 6 months ago
Automatic Learning of Background Semantics in Generic Surveilled Scenes
Advanced surveillance systems for behavior recognition in outdoor traffic scenes depend strongly on the particular configuration of the scenario. Scene-independent trajectory analy...
Carles Fernández, Jordi Gonzàlez, Xavier Roca
120
Voted
PLDI
2003
ACM
15 years 8 months ago
Predicting whole-program locality through reuse distance analysis
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
Chen Ding, Yutao Zhong
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 3 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo