Sciweavers

1399 search results - page 154 / 280
» New Algorithms for k-Center and Extensions
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 2 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
IVC
2007
187views more  IVC 2007»
15 years 5 months ago
Non-rigid structure from motion using ranklet-based tracking and non-linear optimization
In this paper, we address the problem of estimating the 3D structure and motion of a deformable object given a set of image features tracked automatically throughout a video seque...
Alessio Del Bue, Fabrizio Smeraldi, Lourdes de Aga...
IROS
2007
IEEE
119views Robotics» more  IROS 2007»
15 years 11 months ago
Self-localization of a heterogeneous multi-robot team in constrained 3D space
Abstract— This paper presents a new approach to the intralocalization among a team of robots working in constrained 3D space of urban environments. As the base formation, a team ...
Yi Feng 0002, Zhigang Zhu, Jizhong Xiao
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 9 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
165
Voted
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
15 years 9 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...