Sciweavers

9842 search results - page 1477 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
16 years 17 days ago
Collaborative interactive evolution
Interactive evolutionary computation (IEC) has proven useful in a variety of applications by combining the subjective evaluation of a user with the massive parallel search power o...
Sean R. Szumlanski, Annie S. Wu, Charles E. Hughes
ICALP
2005
Springer
16 years 17 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
ICALP
2005
Springer
16 years 17 days ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
ICIAR
2005
Springer
16 years 16 days ago
Enhanced Facial Feature Extraction Using Region-Based Super-Resolution Aided Video Sequences
Abstract. Facial feature extraction is a fundamental problem in image processing. Correct extraction of features is essential for the success of many applications. Typical feature ...
Turgay Çelik, Cem Direkoglu, Hüseyin &...
ICN
2005
Springer
16 years 16 days ago
Packet Scheduling Across Networks of Switches
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
Kevin Ross, Nicholas Bambos
« Prev « First page 1477 / 1969 Last » Next »