Sciweavers

1538 search results - page 79 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICA
2004
Springer
15 years 6 months ago
Exploiting Spatiotemporal Information for Blind Atrial Activity Extraction in Atrial Arrhythmias
The analysis and characterization of atrial tachyarrhythmias requires the previous estimation of the atrial activity (AA) free from any ventricular activity and other artefacts. Th...
Francisco Castells, Jorge Igual, Vicente Zarzoso, ...
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
15 years 8 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
FORTE
2004
15 years 2 months ago
Towards Design Recovery from Observations
This paper proposes an algorithm for the construction of an MSC graph from a given set of actual behaviors of an existing concurrent system which has repetitive subfunctions. Such ...
Hasan Ural, Hüsnü Yenigün
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 1 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
GBRPR
2007
Springer
15 years 5 months ago
Image Classification Using Marginalized Kernels for Graphs
We propose in this article an image classification technique based on kernel methods and graphs. Our work explores the possibility of applying marginalized kernels to image process...
Emanuel Aldea, Jamal Atif, Isabelle Bloch