Sciweavers

2713 search results - page 222 / 543
» Parameterized Tree Systems
Sort
View
JCP
2006
232views more  JCP 2006»
15 years 5 months ago
Indexing of Motion Capture Data for Efficient and Fast Similarity Search
As motion capture systems are increasingly used for motion tracking and capture, and more and more surveillance cameras are installed for security protection, more and more motion ...
Chuanjun Li, B. Prabhakaran
NAR
2006
71views more  NAR 2006»
15 years 5 months ago
TSEMA: interactive prediction of protein pairings between interacting families
An entire family of methodologies for predicting protein interactions is based on the observed fact that families of interacting proteins tend to have similar phylogenetic trees d...
José M. G. Izarzugaza, David de Juan, Carle...
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
15 years 5 months ago
Performance bounds for peer-assisted live streaming
Peer-assisted streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers exchange video ch...
Shao Liu, Rui Zhang-Shen, Wenjie Jiang, Jennifer R...
MT
2010
100views more  MT 2010»
15 years 3 months ago
Exploiting syntactic relationships in a phrase-based decoder: an exploration
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drastically oversimplified reordering models. Syntactically aware models make it pos...
Tim Hunter, Philip Resnik
210
Voted
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 3 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks