Sciweavers

523 search results - page 27 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
IVC
2000
179views more  IVC 2000»
15 years 1 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
16 years 2 months ago
Stream Monitoring under the Time Warping Distance
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...
Yasushi Sakurai, Christos Faloutsos, Masashi Yamam...
ICASSP
2011
IEEE
14 years 5 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
PODC
2009
ACM
16 years 1 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
CANS
2008
Springer
111views Cryptology» more  CANS 2008»
15 years 3 months ago
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
Tiancheng Lou, Christophe Tartary