Sciweavers

1012 search results - page 166 / 203
» Segment intersection searching problems in general settings
Sort
View
ICML
2010
IEEE
15 years 26 days ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
EOR
2007
198views more  EOR 2007»
14 years 11 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
ICRA
2006
IEEE
190views Robotics» more  ICRA 2006»
15 years 5 months ago
An Integrated Approach to Inverse Kinematics and Path Planning for Redundant Manipulators
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
Dominik Bertram, James Kuffner, Rüdiger Dillm...
GIS
2006
ACM
16 years 25 days ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 3 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...