Sciweavers

2036 search results - page 84 / 408
» From Sampling to Model Counting
Sort
View
JCO
2006
126views more  JCO 2006»
15 years 1 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
IJPRAI
2008
235views more  IJPRAI 2008»
15 years 1 months ago
Shape-Based Individual/Group Detection for Sport Videos Categorization
We present a shape based method for automatic people detection and counting without any assumption or knowledge of camera motion. The proposed method is applied to athletic videos...
Costas Panagiotakis, Emmanuel Ramasso, Georgios Tz...
AAAI
2006
15 years 2 months ago
Bayesian Calibration for Monte Carlo Localization
Localization is a fundamental challenge for autonomous robotics. Although accurate and efficient techniques now exist for solving this problem, they require explicit probabilistic...
Armita Kaboli, Michael H. Bowling, Petr Musí...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 1 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ICASSP
2011
IEEE
14 years 5 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee