Sciweavers

919 search results - page 94 / 184
» Generalizing over Several Learning Settings
Sort
View
ICML
2004
IEEE
16 years 2 months ago
Parameter space exploration with Gaussian process trees
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
Robert B. Gramacy, Herbert K. H. Lee, William G. M...
NAACL
2004
15 years 3 months ago
Robust Reading: Identification and Tracing of Ambiguous Names
A given entity, representing a person, a location or an organization, may be mentioned in text in multiple, ambiguous ways. Understanding natural language requires identifying whe...
Xin Li, Paul Morie, Dan Roth
PODC
2011
ACM
14 years 4 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICML
2008
IEEE
16 years 2 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
PKDD
2009
Springer
103views Data Mining» more  PKDD 2009»
15 years 8 months ago
Kernels for Periodic Time Series Arising in Astronomy
Abstract. We present a method for applying machine learning algorithms to the automatic classification of astronomy star surveys using time series of star brightness. Currently su...
Gabriel Wachman, Roni Khardon, Pavlos Protopapas, ...