Sciweavers

9209 search results - page 201 / 1842
» Data Space Randomization
Sort
View
FOCS
2009
IEEE
15 years 10 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
159
Voted
IJON
2007
120views more  IJON 2007»
15 years 6 months ago
Comparison of dynamical states of random networks with human EEG
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
Ralph Meier, Arvind Kumar, Andreas Schulze-Bonhage...
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
16 years 6 months ago
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Collaborative filtering is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it cannot make recommendations ...
Mohsen Jamali, Martin Ester
BMCBI
2008
169views more  BMCBI 2008»
15 years 6 months ago
A comprehensive comparison of random forests and support vector machines for microarray-based cancer classification
Background: Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular sig...
Alexander R. Statnikov, Lily Wang, Constantin F. A...
IDEAS
2003
IEEE
86views Database» more  IDEAS 2003»
15 years 11 months ago
A Medium Complexity Discrete Model for Uncertain Spatial Data
This paper presents a method for representing uncertainty in spatial data in a database. The model presented requires moderate amounts of storage space. To compute the probability...
Erlend Tøssebro, Mads Nygård