5115 search results - page 498 / 1023 » On Randomized Lanczos Algorithms |
178
click to vote
ISAAC
2005
Springer
16 years 12 days ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
181
click to vote
GD
2004
Springer
16 years 8 days ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
214
click to vote
ILP
2004
Springer
16 years 8 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
215
click to vote
GCC
2003
Springer
16 years 3 days ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
197
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. Computer vision algorithms for individual tasks such as object recognition, detection and segmentation have shown impressive results in the recent past. The next challeng...