Sciweavers

334 search results - page 49 / 67
» Dynamic Three-Dimensional Linear Programming
Sort
View
ICPR
2002
IEEE
15 years 2 months ago
Feature Extraction Methods Applied to the Clustering of Electrocardiographic Signals. A Comparative Study
In this paper, a method to automatically extract the main information from a long-term electrocardiographic signal is presented. This method is based on techniques of pattern reco...
David Cuesta-Frau, Juan Carlos Pérez-Cortes...
GLOBECOM
2008
IEEE
15 years 4 months ago
Collusion-Resistant Multi-Winner Spectrum Auction for Cognitive Radio Networks
—In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from s...
Yongle Wu, Beibei Wang, K. J. Ray Liu, T. Charles ...
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
15 years 4 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
14 years 11 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
JMLR
2010
149views more  JMLR 2010»
14 years 4 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...