Sciweavers

483 search results - page 73 / 97
» Linear Ranking with Reachability
Sort
View
CIE
2009
Springer
14 years 3 months ago
Cutting Planes and the Parameter Cutwidth
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
Stefan S. Dantchev, Barnaby Martin
IROS
2007
IEEE
135views Robotics» more  IROS 2007»
14 years 3 months ago
Power-SLAM: A linear-complexity, consistent algorithm for SLAM
— In this paper, we present an Extended Kalman Filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the n...
Esha D. Nerurkar, Stergios I. Roumeliotis
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
14 years 27 days ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
DAS
2010
Springer
14 years 2 days ago
Improved classification through runoff elections
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...
Oleg Golubitsky, Stephen M. Watt