Sciweavers

1688 search results - page 137 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CBMS
2006
IEEE
15 years 12 months ago
A Method for Fetal Heart Rate Extraction Based on Time-Frequency Analysis
A three-stage method for fetal heart rate extraction, from abdominal ECG recordings, is proposed. In the first stage the maternal R-peaks and fiducial points (QRS onset and offset...
E. C. Karvounis, Markos G. Tsipouras, Dimitrios I....
ECCV
2004
Springer
16 years 7 months ago
A Constrained Semi-supervised Learning Approach to Data Association
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
Hendrik Kück, Nando de Freitas, Peter Carbone...
ICDE
2007
IEEE
94views Database» more  ICDE 2007»
16 years 7 months ago
RoXSum: Leveraging Data Aggregation and Batch Processing for XML Routing
Content-based routing is the primary form of communication within publish/subscribe systems. In those systems data transmission is performed by sophisticated overlay networks of c...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
GIS
2007
ACM
16 years 7 months ago
Dynamics-aware similarity of moving objects trajectories
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Robe...
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 6 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito