Sciweavers

4926 search results - page 507 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
143
Voted
ICRA
2008
IEEE
134views Robotics» more  ICRA 2008»
15 years 10 months ago
Towards robust place recognition for robot localization
— Localization and context interpretation are two key competences for mobile robot systems. Visual place recognition, as opposed to purely geometrical models, holds promise of hi...
Muhammad Muneeb Ullah, Andrzej Pronobis, Barbara C...
115
Voted
ICCV
2003
IEEE
16 years 5 months ago
Towards a Mathematical Theory of Primal Sketch and Sketchability
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
123
Voted
SPAA
1996
ACM
15 years 7 months ago
BSP vs LogP
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietr...
100
Voted
DBA
2004
93views Database» more  DBA 2004»
15 years 5 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke
146
Voted
TCS
2010
15 years 2 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...