Sciweavers

1236 search results - page 81 / 248
» fast 2010
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
ECCV
2010
Springer
14 years 1 months ago
Recursive Coarse-to-Fine Localization for fast Object Detection
Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors a...
Marco Pedersoli, Jordi Gonzàlez, Andrew D. Bagdan...
CIKM
2010
Springer
13 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
IOR
2010
114views more  IOR 2010»
13 years 8 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
MICCAI
2010
Springer
13 years 8 months ago
Model-Free, Regularized, Fast, and Robust Analytical Orientation Distribution Function Estimation
High Angular Resolution Imaging (HARDI) can better explore the complex micro-structure of white matter compared to Diffusion Tensor Imaging (DTI). Orientation Distribution Functio...
Jian Cheng, Aurobrata Ghosh, Rachid Deriche, Tianz...