Sciweavers

2374 search results - page 109 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
CVPR
2011
IEEE
14 years 7 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
SAC
2005
ACM
15 years 3 months ago
Handling run-time updates in distributed applications
The server side of business software systems is commonly implemented today by an ensemble of Java classes distributed over several hosts. In this scenario, it is often necessary, ...
Marco Milazzo, Giuseppe Pappalardo, Emiliano Tramo...
ICFP
2005
ACM
15 years 3 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
PAMI
2010
168views more  PAMI 2010»
14 years 8 months ago
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
NIPS
1994
14 years 11 months ago
On-line Learning of Dichotomies
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
N. Barkai, H. Sebastian Seung, Haim Sompolinsky