Sciweavers

2127 search results - page 48 / 426
» Computing large matchings fast
Sort
View
127
Voted
ICCV
1995
IEEE
15 years 7 months ago
Fast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
Margrit Betke, Nicholas C. Makris
151
Voted
CVPR
2012
IEEE
13 years 6 months ago
Real-time image-based 6-DOF localization in large-scale environments
We present a real-time approach for image-based localization within large scenes that have been reconstructed offline using structure from motion (Sfm). From monocular video, our...
Hyon Lim, Sudipta N. Sinha, Michael F. Cohen, Matt...
SIGCOMM
1998
ACM
15 years 7 months ago
Fast and Scalable Layer Four Switching
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
Venkatachary Srinivasan, George Varghese, Subhash ...
120
Voted
INTERNET
2007
105views more  INTERNET 2007»
15 years 3 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
132
Voted
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
15 years 4 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel