Sciweavers

315 search results - page 29 / 63
» Better Approximation of Betweenness Centrality
Sort
View
CIKM
2010
Springer
13 years 8 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
BMVC
2010
13 years 7 months ago
A principled approach to remove false alarms by modelling the context of a face detector
In this article we present a new method to enhance object detection by removing false alarms in a principled way with few parameters. The method models the output of an object cla...
Cosmin Atanasoaei, Chris McCool, Sébastien ...
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
13 years 7 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
13 years 7 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
ICRA
2009
IEEE
100views Robotics» more  ICRA 2009»
13 years 7 months ago
Multi-robot plan adaptation by constrained minimal distortion feature mapping
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
Bálint Takács, Yiannis Demiris