Sciweavers

204 search results - page 36 / 41
» Parameterizations of Test Cover with Bounded Test Sizes
Sort
View
NIPS
2008
14 years 11 months ago
Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning
Randomized neural networks are immortalized in this well-known AI Koan: In the days when Sussman was a novice, Minsky once came to him as he sat hacking at the PDP-6. "What a...
Ali Rahimi, Benjamin Recht
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
14 years 11 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà
COMCOM
2006
93views more  COMCOM 2006»
14 years 10 months ago
On scalability properties of the Hi3 control plane
The Host Identity Indirection Infrastructure (Hi3) is a general-purpose networking architecture, derived from the Internet Indirection Infrastructure (i3) and the Host Identity Pr...
Dmitry Korzun, Andrei Gurtov
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
14 years 10 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
PROPERTYTESTING
2010
14 years 8 months ago
Transitive-Closure Spanners: A Survey
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
Sofya Raskhodnikova