Sciweavers

1538 search results - page 179 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 3 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
DCG
2011
14 years 10 months ago
Small Grid Embeddings of 3-Polytopes
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
Ares Ribó Mor, Günter Rote, Andr&eacut...
111
Voted
CBMS
2006
IEEE
15 years 10 months ago
A Preliminary Study of Respiratory Variations in the Photoplethysmogram during Lower Body Negative Pressure
Previous studies have shown that the photoplethysmogram (PPG) may be a useful tool for the noninvasive detection of hypovolemia. The focus has been on determining if frequency ana...
Suzanne Wendelken, Stephen Paul Linder, Sue McGrat...
JCM
2008
57views more  JCM 2008»
15 years 3 months ago
An RF-ID Reader Using SAW Dispersive Delay Lines For Wideband Synchronisation
Abstract-- RF-ID systems are susceptible to frequency interference from other communciation systems particularly when the RF-ID tags transmit on a fixed carrier frequency. The RF-I...
Thomas M. McCoy, Paul V. Brennan, Richard J. Bullo...
TWC
2008
120views more  TWC 2008»
15 years 3 months ago
Energy minimization of a QAM system with fading
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...
Raghavendra S. Prabhu, Babak Daneshrad