Sciweavers

2004 search results - page 220 / 401
» Sampling from large graphs
Sort
View
139
Voted
ICML
2007
IEEE
16 years 4 months ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
KDD
2003
ACM
152views Data Mining» more  KDD 2003»
16 years 4 months ago
Interactive exploration of coherent patterns in time-series gene expression data
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we pr...
Daxin Jiang, Jian Pei, Aidong Zhang
132
Voted
CSE
2009
IEEE
15 years 10 months ago
A Visual Interface for Social Information Filtering
Abstract—Collaborative or “Social” filtering has been successfully deployed over the years as a technique for analysing large amounts of user-preference knowledge to predict...
John O'Donovan, Brynjar Gretarsson, Svetlin Bostan...
172
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
On the (in)Effectiveness of Probabilistic Marking for IP Traceback Under DDoS Attacks
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
Vamsi Paruchuri, Arjan Durresi, Raj Jain
119
Voted
DLT
2006
15 years 5 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer