Sciweavers

202 search results - page 30 / 41
» A more efficient approximation scheme for tree alignment
Sort
View
EUROPAR
2005
Springer
15 years 5 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
105
Voted
SIGGRAPH
1999
ACM
15 years 4 months ago
Tracing Ray Differentials
Antialiasing of ray traced images is typically performed by supersampling the image plane. While this type of filtering works well for many algorithms, it is much more efficient t...
Homan Igehy
92
Voted
AAAI
2010
15 years 1 months ago
Informed Lifting for Message-Passing
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
Kristian Kersting, Youssef El Massaoudi, Fabian Ha...
CVPR
2006
IEEE
16 years 1 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
195
Voted
GIS
2005
ACM
16 years 21 days ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang