2636 search results - page 290 / 528 » Linear Programming |
135
click to vote
DASFAA
2008
IEEE
15 years 5 months ago
2008
IEEE
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
118
click to vote
ISCAS
1994
IEEE
15 years 7 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
133
click to vote
ESOP
2010
Springer
16 years 19 days ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
132
Voted
SIAMDM
2010
14 years 10 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
161
click to vote
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...