Sciweavers

2613 search results - page 140 / 523
» On an Optimization Problem in Sensor Selection*
Sort
View
JMLR
2006
89views more  JMLR 2006»
14 years 10 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 10 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
COR
2008
116views more  COR 2008»
14 years 10 months ago
Robust multiperiod portfolio management in the presence of transaction costs
We study the viability of different robust optimization approaches to multiperiod portfolio selection. Robust optimization models treat future asset returns as uncertain coefficie...
Dimitris Bertsimas, Dessislava Pachamanova
83
Voted
INFOCOM
1999
IEEE
15 years 2 months ago
Efficient Selective Frame Discard Algorithms for Stored Video Delivery across Resource Constrained Networks
Video delivery from a server to a client across a network is an important component of many multimedia applications. While delivering a video stream across a resource constrained ...
Zhi-Li Zhang, Srihari Nelakuditi, Rahul Aggarwal, ...
VLDB
2005
ACM
126views Database» more  VLDB 2005»
15 years 3 months ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...