Sciweavers

168 search results - page 10 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
AAECC
2004
Springer
83views Algorithms» more  AAECC 2004»
13 years 7 months ago
Bounding the Trellis State Complexity of Algebraic Geometric Codes
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
Carlos Munuera, Fernando Torres
ICIP
2003
IEEE
14 years 9 months ago
Fast similarity search on video signatures
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...
Sen-Ching S. Cheung, Avideh Zakhor
CVPR
2011
IEEE
12 years 11 months ago
Fusion of GPS and Structure-from-Motion using Constrained Bundle Adjustments
Two problems occur when bundle adjustment (BA) is applied on long image sequences: the large calculation time and the drift (or error accumulation). In recent work, the calculatio...
Maxime Lhuillier
JUCS
2007
88views more  JUCS 2007»
13 years 7 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden