Sciweavers

789 search results - page 105 / 158
» Comparing Variations on the Active Appearance Model Algorith...
Sort
View
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
15 years 5 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...
ICML
2006
IEEE
16 years 5 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
SOCIALCOM
2010
15 years 2 months ago
Learning to Predict Ad Clicks Based on Boosted Collaborative Filtering
This paper addresses the topic of social advertising, which refers to the allocation of ads based on individual user social information and behaviors. As social network services (e...
Teng-Kai Fan, Chia-Hui Chang
ICRA
2008
IEEE
145views Robotics» more  ICRA 2008»
15 years 11 months ago
Who am I talking with? A face memory for social robots
— In order to provide personalized services and to develop human-like interaction capabilities robots need to recognize their human partner. Face recognition has been studied in ...
Marc Hanheide, Sebastian Wrede, Christian Lang, Ge...
SIGCOMM
2009
ACM
15 years 11 months ago
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...
Ramana Rao Kompella, Kirill Levchenko, Alex C. Sno...