Sciweavers

243 search results - page 29 / 49
» On randomized representations of graphs using short labels
Sort
View
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
ICASSP
2011
IEEE
12 years 11 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
ICMCS
2007
IEEE
112views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Detecting Unsafe Driving Patterns using Discriminative Learning
We propose a discriminative learning approach for fusing multichannel sequential data with application to detect unsafe driving patterns from multi-channel driving recording data....
Yue Zhou, Wei Xu, Huazhong Ning, Yihong Gong, Thom...
ECCV
2006
Springer
14 years 9 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock
SIGCOMM
2006
ACM
14 years 1 months ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...