1425 search results - page 194 / 285 » Beyond Dependency Graphs |
EMSOFT
2011
Springer
12 years 8 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
ICSE
2003
IEEE-ACM
14 years 8 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...