Sciweavers

9949 search results - page 302 / 1990
» On the Network Complexity of Selection
Sort
View
TSP
2010
15 years 1 months ago
Doubly selective channel estimation using exponential basis models and subblock tracking
Three versions of a novel adaptive channel estimation approach, exploiting the over-sampled complex exponential basis expansion model (CE-BEM), is presented fordoubly selectivechan...
Jitendra K. Tugnait, Shuangchi He, Hyosung Kim
NETWORKING
2010
15 years 8 months ago
Toward Efficient On-Demand Streaming with BitTorrent
This paper considers the problem of adapting the BitTorrent protocol for on-demand streaming. BitTorrent is a popular peer-to-peer file sharing protocol that efficiently accommodat...
Youmna Borghol, Sebastien Ardon, Niklas Carlsson, ...
CVPR
2007
IEEE
16 years 8 months ago
Object Tracking by Asymmetric Kernel Mean Shift with Automatic Scale and Orientation Selection
Tracking objects using the mean shift method is performed by iteratively translating a kernel in the image space such that the past and current object observations are similar. Tr...
Alper Yilmaz
CHI
2009
ACM
16 years 7 months ago
Ephemeral adaptation: the use of gradual onset to improve menu selection performance
We introduce ephemeral adaptation, a new adaptive GUI technique that improves performance by reducing visual search time while maintaining spatial consistency. Ephemeral adaptive ...
Leah Findlater, Karyn Moffatt, Joanna McGrenere, J...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang