2636 search results - page 355 / 528 » Linear Programming |
130
click to vote
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
124
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
115
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Sequence segmentation is a flexible and highly accurate mechanism for modeling several applications. Inference on segmentation models involves dynamic programming computations tha...
150
click to vote
WWW
2006
ACM
16 years 4 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
126
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...