1879 search results - page 100 / 376 » Computational geometry algorithms library |
122
click to vote
ISCOPE
1998
Springer
15 years 8 months ago
1998
Springer
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
141
click to vote
MP
2010
15 years 2 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
151
click to vote
DAGM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Graphical models with higher order factors are an important tool for pattern recognition that has recently attracted considerable attention. Inference based on such model...
153
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
126
click to vote
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely ...