Sciweavers

5115 search results - page 947 / 1023
» On Randomized Lanczos Algorithms
Sort
View
127
Voted
IUI
2010
ACM
15 years 11 months ago
A POMDP approach to P300-based brain-computer interfaces
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
Jaeyoung Park, Kee-Eung Kim, Sungho Jo
155
Voted
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 9 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
112
Voted
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
15 years 9 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
148
Voted
FSE
2009
Springer
159views Cryptology» more  FSE 2009»
15 years 9 months ago
Intel's New AES Instructions for Enhanced Performance and Security
The Advanced Encryption Standard (AES) is the Federal Information Processing Standard for symmetric encryption. It is widely believed to be secure and efficient, and is therefore b...
Shay Gueron
98
Voted
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
15 years 9 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja