Sciweavers

5170 search results - page 407 / 1034
» Consistency of the FastSLAM Algorithm
Sort
View
163
Voted
P2P
2007
IEEE
117views Communications» more  P2P 2007»
16 years 1 months ago
Peer-to-Peer Rating
This paper proposes to utilize algorithms from the probabilistic graphical models domain for Peer-to-Peer rating of data items and for computing “social influence” of nodes i...
Danny Bickson, Dahlia Malkhi, Lidong Zhou
CIA
2007
Springer
16 years 1 months ago
From Local Search to Global Behavior: Ad Hoc Network Example
We introduce the Consensual N-Player Prisoner’s Dilemma as a large-scale dilemma. We then present a framework for cooperative consensus formation in large-scale MAS under the N-P...
Osher Yadgar
215
Voted
CP
2007
Springer
16 years 1 months ago
Filtering for Subgraph Isomorphism
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
Stéphane Zampelli, Yves Deville, Christine ...
ESA
2007
Springer
81views Algorithms» more  ESA 2007»
16 years 1 months ago
Farthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
Otfried Cheong, Hazel Everett, Marc Glisse, Joachi...
ICCS
2007
Springer
16 years 1 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...