Sciweavers

238 search results - page 39 / 48
» Learning for Optical Flow Using Stochastic Optimization
Sort
View
AAAI
2008
13 years 10 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 10 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 2 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
CVPR
2008
IEEE
14 years 9 months ago
Extracting a fluid dynamic texture and the background from video
Given the video of a still background occluded by a fluid dynamic texture (FDT), this paper addresses the problem of separating the video sequence into its two constituent layers....
Bernard Ghanem, Narendra Ahuja
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr