Sciweavers

334 search results - page 28 / 67
» Boosting with structural sparsity
Sort
View
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 8 months ago
Iterative Filtering for a Dynamical Reputation System
The paper introduces a novel iterative method that assigns a reputation to n + m items: n raters and m objects. Each rater evaluates a subset of objects leading to a n × m rating...
Cristobald de Kerchove, Paul Van Dooren
OOPSLA
2005
Springer
14 years 1 months ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine
ICPR
2008
IEEE
14 years 2 months ago
Robust estimation of foreground in surveillance videos by sparse error estimation
Frames of videos with static background and dynamic foreground can be viewed as samples of signals that vary slowly in time with sparse corruption caused by foreground objects. We...
Mert Dikmen, Thomas S. Huang
AROBOTS
2006
119views more  AROBOTS 2006»
13 years 8 months ago
A Discussion of Simultaneous Localization and Mapping
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
Udo Frese
BMCBI
2010
86views more  BMCBI 2010»
13 years 8 months ago
Mining protein loops using a structural alphabet and statistical exceptionality
Background: Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, ca...
Leslie Regad, Juliette Martin, Grégory Nuel...