Sciweavers

1536 search results - page 117 / 308
» Approximately Dominating Representatives
Sort
View
ICDCS
2010
IEEE
15 years 8 months ago
Sifting through Network Data to Cull Activity Patterns with HEAPs
—Today’s large campus and enterprise networks are characterized by their complexity, i.e. containing thousands of hosts, and diversity, i.e. with various applications and usage...
Esam Sharafuddin, Yu Jin, Nan Jiang, Zhi-Li Zhang
ACCV
2006
Springer
15 years 7 months ago
Key Frame-Based Activity Representation Using Antieigenvalues
Many activities may be characterized by a sequence of key frames that are related to important changes in motion rather than dominant characteristics that persist over a long seque...
Naresh P. Cuntoor, Rama Chellappa
ASAP
2004
IEEE
141views Hardware» more  ASAP 2004»
15 years 7 months ago
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
A. Murat Fiskiran, Ruby B. Lee
DAGM
2006
Springer
15 years 7 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
EMO
2006
Springer
87views Optimization» more  EMO 2006»
15 years 7 months ago
Symbolic Archive Representation for a Fast Nondominance Test
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
Martin Lukasiewycz, Michael Glaß, Christian ...