Sciweavers

779 search results - page 46 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
INFOCOM
2006
IEEE
15 years 10 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz
ICPP
2006
IEEE
15 years 10 months ago
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
Robert Niewiadomski, José Nelson Amaral, Ro...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
WEBI
2007
Springer
15 years 10 months ago
Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...
Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B...
HIS
2008
15 years 5 months ago
Artificial Data Sets Based on Knowledge Generators: Analysis of Learning Algorithms Efficiency
This paper proposes a methodology to generate artificial data sets to evaluate the behavior of machine learning techniques. The methodology relies in the definition of a domain an...
Joaquin Rios-Boutin, Albert Orriols-Puig, Josep Ma...