Sciweavers

4860 search results - page 432 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
MM
2004
ACM
109views Multimedia» more  MM 2004»
15 years 9 months ago
Loss-resilient on-demand media streaming using priority encoding
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
Cheng Huang, Ramaprabhu Janakiraman, Lihao Xu
ICCV
2009
IEEE
15 years 1 months ago
Real-time visual tracking via Incremental Covariance Tensor Learning
Visual tracking is a challenging problem, as an object may change its appearance due to pose variations, illumination changes, and occlusions. Many algorithms have been proposed t...
Yi Wu, Jian Cheng, Jinqiao Wang, Hanqing Lu
143
Voted
BALT
2010
14 years 11 months ago
Bringing Domain Knowledge to Pattern Matching
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
Agris Sostaks
129
Voted
ICC
2007
IEEE
102views Communications» more  ICC 2007»
15 years 10 months ago
Distributed Scheduling in Input Queued Switches
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...
Alessandra Scicchitano, Andrea Bianco, Paolo Giacc...
FOSAD
2000
Springer
15 years 7 months ago
Security Goals: Packet Trajectories and Strand Spaces
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
Joshua D. Guttman