Sciweavers

10414 search results - page 326 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
ASE
2010
129views more  ASE 2010»
15 years 6 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
EOR
2010
125views more  EOR 2010»
15 years 6 months ago
Efficient estimation of large portfolio loss probabilities in t-copula models
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
Joshua C. C. Chan, Dirk P. Kroese
IEICET
2006
77views more  IEICET 2006»
15 years 6 months ago
Efficient Scheduling for SDMG CIOQ Switches
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
Mei Yang, Si-Qing Zheng
IS
2008
15 years 6 months ago
Efficient mining of frequent episodes from complex sequences
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
Kuo-Yu Huang, Chia-Hui Chang