5115 search results - page 500 / 1023 » On Randomized Lanczos Algorithms |
155
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
205
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
200
click to vote
CISS
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
200
click to vote
ALGORITHMICA
2007
15 years 7 months ago
2007
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
204
click to vote
FUIN
2008
15 years 7 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...