Sciweavers

886 search results - page 118 / 178
» On the Autoreducibility of Random Sequences
Sort
View
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 1 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
ACCV
2006
Springer
14 years 1 months ago
A Novel Robust Statistical Method for Background Initialization and Visual Surveillance
In many visual tracking and surveillance systems, it is important to initialize a background model using a training video sequence which may include foreground objects. In such a c...
Hanzi Wang, David Suter
ICCV
2005
IEEE
14 years 1 months ago
On the Spatial Statistics of Optical Flow
We develop a method for learning the spatial statistics of optical flow fields from a novel training database. Training flow fields are constructed using range images of natur...
Stefan Roth, Michael J. Black
IH
2005
Springer
14 years 1 months ago
Embedding Covert Channels into TCP/IP
It is commonly believed that steganography within TCP/IP is easily achieved by embedding data in header fields seemingly filled with “random” data, such as the IP identifier...
Steven J. Murdoch, Stephen Lewis
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk