Sciweavers

27 search results - page 4 / 6
» Lower Bounds for Hit-and-Run Direct Search
Sort
View
TSP
2008
132views more  TSP 2008»
13 years 5 months ago
Differential Modulations for Multinode Cooperative Communications
Abstract--This paper proposes and analyzes differential modulation schemes for two cooperation protocols in multinode cooperative wireless networks; namely, multinode differential ...
Thanongsak Himsoon, W. Pam Siriwongpairat, Weifeng...
TCS
2010
13 years 3 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
MIR
2004
ACM
110views Multimedia» more  MIR 2004»
13 years 10 months ago
Symbolic representation and retrieval of moving object trajectories
Searching moving object trajectories of video databases has been applied to many fields, such as video data analysis, content-based video retrieval, video scene classification. ...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
13 years 9 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
DAGSTUHL
2006
13 years 6 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl