Sciweavers

1609 search results - page 150 / 322
» Problem Structure and Dependable Architecture
Sort
View
UAI
2003
15 years 1 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ML
2006
ACM
149views Machine Learning» more  ML 2006»
15 years 12 days ago
A case based approach to expressivity-aware tempo transformation
The research presented in this paper is focused on global tempo transformations of music performances. We are investigating the problem of how a performance played at a particular...
Maarten Grachten, Josep Lluís Arcos, Ramon ...
107
Voted
PAMI
2008
243views more  PAMI 2008»
15 years 12 days ago
Shape from Defocus via Diffusion
Defocus can be modeled as a diffusion process and represented mathematically using the heat equation, where image blur corresponds to the diffusion of heat. This analogy can be ext...
Paolo Favaro, Stefano Soatto, Martin Burger, Stanl...
HPCA
2008
IEEE
16 years 25 days ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 18 days ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita