Sciweavers

3270 search results - page 604 / 654
» Approximate String Processing
Sort
View
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
GIS
2010
ACM
13 years 6 months ago
Reverse k-Nearest Neighbor monitoring on mobile objects
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
ICRA
2010
IEEE
158views Robotics» more  ICRA 2010»
13 years 6 months ago
Real-time monocular SLAM: Why filter?
Abstract— While the most accurate solution to off-line structure from motion (SFM) problems is undoubtedly to extract as much correspondence information as possible and perform g...
Hauke Strasdat, J. M. M. Montiel, Andrew J. Daviso...
IOR
2010
114views more  IOR 2010»
13 years 6 months ago
Inventory Management of a Fast-Fashion Retail Network
Working in collaboration with Spain-based retailer Zara, we address the problem of distributing over time a limited amount of inventory across all the stores in a fast-fashion ret...
Felipe Caro, Jérémie Gallien
RSA
2010
107views more  RSA 2010»
13 years 6 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou