Sciweavers

5138 search results - page 312 / 1028
» Low-Entropy Set Selection.
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
13 years 9 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
SIGIR
2009
ACM
16 years 1 months ago
The impact of crawl policy on web search effectiveness
Crawl selection policy has a direct influence on Web search effectiveness, because a useful page that is not selected for crawling will also be absent from search results. Yet th...
Dennis Fetterly, Nick Craswell, Vishwa Vinay
IJCNN
2008
IEEE
16 years 1 months ago
Filter Bank Common Spatial Pattern (FBCSP) in Brain-Computer Interface
—In motor imagery-based Brain Computer Interfaces (BCI), discriminative patterns can be extracted from the electroencephalogram (EEG) using the Common Spatial Pattern (CSP) algor...
Kai Keng Ang, Zhang Yang Chin, Haihong Zhang, Cunt...
CN
2006
112views more  CN 2006»
15 years 6 months ago
Optimal server allocations for streaming multimedia applications on the Internet
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
Padmavathi Mundur, Poorva Arankalle