2004 search results - page 97 / 401 » Sampling from large graphs |
141
click to vote
NIPS
2008
15 years 4 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
120
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
106
click to vote
ICSE
2004
IEEE-ACM
16 years 3 months ago
2004
IEEE-ACM
Abstract. Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to ...
136
click to vote
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
149
click to vote
CC
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A key scalability challenge for interprocedural dataflow analysis comes from large libraries. Our work addresses this challenge for the general category of interprocedura...