Sciweavers

1286 search results - page 100 / 258
» A General Framework for Searching in Distributed Data Reposi...
Sort
View
ICPP
1991
IEEE
13 years 11 months ago
Automatic Parallel Program Generation and Optimization from Data Decompositions
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
Edwin M. R. M. Paalvast, Henk J. Sips, Arjan J. C....
JMLR
2006
186views more  JMLR 2006»
13 years 8 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
PPSN
2000
Springer
13 years 11 months ago
An Analysis of Dynamic Severity and Population Size
This work introduces a general mathematical framework for non-stationary fitness functions which enables the exact definition of certain problem properties. The properties' in...
Karsten Weicker
PDP
2003
IEEE
14 years 1 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera