Sciweavers

1382 search results - page 34 / 277
» Term ordering problem on MDG
Sort
View
CAP
2010
13 years 6 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
JSCIC
2007
100views more  JSCIC 2007»
13 years 10 months ago
Implicit-Explicit Schemes for BGK Kinetic Equations
In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be con...
Sandra Pieraccini, Gabriella Puppo
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 11 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 8 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
CVPR
2007
IEEE
14 years 5 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...