Sciweavers

5171 search results - page 846 / 1035
» Deterministic Parallel Processing
Sort
View
149
Voted
DAGM
2010
Springer
15 years 4 months ago
On-Line Multi-view Forests for Tracking
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
Christian Leistner, Martin Godec, Amir Saffari, Ho...
114
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 3 months ago
Random Information Spread in Networks
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
Raymond Lapus, Frank Simon, Peter Tittmann
IEEESP
2008
89views more  IEEESP 2008»
15 years 3 months ago
Virtual Machine Introspection: Observation or Interference?
hardware, eliminating an abstraction layer and often improving efficiency as a result. Examples of type 1 systems include VMware ESX,3 Xen (www. xensource.com/xen/xen/nfamily/virtu...
Kara L. Nance, Matt Bishop, Brian Hay
130
Voted
JRTIP
2008
249views more  JRTIP 2008»
15 years 3 months ago
Model-based mapping of reconfigurable image registration on FPGA platforms
Abstract Image registration is a computationally intensive application in the medical imaging domain that places stringent requirements on performance and memory management efficie...
Mainak Sen, Yashwanth Hemaraj, William Plishker, R...
137
Voted
TCS
2008
15 years 3 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...