Sciweavers

5153 search results - page 506 / 1031
» Introduction to Randomized Algorithms
Sort
View
ILP
2004
Springer
15 years 12 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
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 ...
Frank DiMaio, Jude W. Shavlik
GCC
2003
Springer
15 years 11 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— 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...
Chunlin Yang, Jie Wu
ECCV
2010
Springer
15 years 11 months ago
What, Where & How Many? Combining Object Detectors and CRFs
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...
INFOCOM
1998
IEEE
15 years 10 months ago
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
Santosh Paul Abraham, Anurag Kumar
WG
1993
Springer
15 years 10 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...