Sciweavers

680 search results - page 75 / 136
» A randomized embedding algorithm for trees
Sort
View
ECCV
2006
Springer
14 years 10 months ago
Feature Harvesting for Tracking-by-Detection
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...
Mustafa Özuysal, Vincent Lepetit, Franç...
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 1 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
14 years 1 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
COCOON
1999
Springer
14 years 1 months ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
ICASSP
2010
IEEE
13 years 9 months ago
Evaluation of a stereo audio data hiding method using inter-channel decorrelator polarity
We extensively evaluated a data hiding algorithm for stereo audio signals which embeds data using the polarity of the echoes added to the high-frequency channels, which we have pr...
Kazuhiro Kondo