2137 search results - page 288 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
148
click to vote
IPL
2010
15 years 3 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
178
click to vote
COMPGEOM
1996
ACM
15 years 9 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
235
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
130
click to vote
ICCV
1999
IEEE
16 years 7 months ago
1999
IEEE
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes...
135
click to vote
BIOSYSTEMS
2007
15 years 5 months ago
2007
This paper proposes and evaluates a multi-objective evolutionary algorithm for survival analysis. One aim of survival analysis is the extraction of models from data that approxima...