Sciweavers

2104 search results - page 97 / 421
» Sorting with networks of data structures
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 4 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
IJRR
2006
116views more  IJRR 2006»
15 years 4 months ago
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
Sebastian Thrun, Michael Montemerlo
CADE
2008
Springer
16 years 4 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ECCV
2010
Springer
15 years 2 months ago
Element-Wise Factorization for N-View Projective Reconstruction
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...
Yuchao Dai, Hongdong Li, Mingyi He