Sciweavers

1994 search results - page 73 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
115
Voted
CVPR
2005
IEEE
16 years 4 months ago
A Closed Form Solution to Direct Motion Segmentation
We present a closed form solution to the problem of segmenting multiple 2-D motion models of the same type directly from the partial derivatives of an image sequence. We introduce...
Dheeraj Singaraju, René Vidal
114
Voted
ICPR
2002
IEEE
16 years 3 months ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...
108
Voted
NETWORKING
2007
15 years 3 months ago
The Token Based Switch: Per-Packet Access Authorisation to Optical Shortcuts
Abstract. Our Token Based Switch (TBS) implementation shows that a packetbased admission control system can be used to dynamically select a fast end-to-end connection over a hybrid...
Mihai-Lucian Cristea, Leon Gommans, Li Xu, Herbert...
144
Voted
ISMB
1996
15 years 3 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...
185
Voted
CF
2011
ACM
14 years 2 months ago
SIFT: a low-overhead dynamic information flow tracking architecture for SMT processors
Dynamic Information Flow Tracking (DIFT) is a powerful technique that can protect unmodified binaries from a broad range of vulnerabilities such as buffer overflow and code inj...
Meltem Ozsoy, Dmitry Ponomarev, Nael B. Abu-Ghazal...