Sciweavers

10608 search results - page 2110 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
LATINCRYPT
2010
13 years 5 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
OOPSLA
2010
Springer
13 years 5 months ago
Cross-language, type-safe, and transparent object sharing for co-located managed runtimes
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
Michal Wegiel, Chandra Krintz
PAMI
2010
181views more  PAMI 2010»
13 years 5 months ago
Using Language to Learn Structured Appearance Models for Image Annotation
Abstract— Given an unstructured collection of captioned images of cluttered scenes featuring a variety of objects, our goal is to simultaneously learn the names and appearances o...
Michael Jamieson, Afsaneh Fazly, Suzanne Stevenson...
PRL
2010
173views more  PRL 2010»
13 years 5 months ago
Resolving stereo matching errors due to repetitive structures using model information
This study regards the problem of incorrect stereo matches due to the occurrence of repetitive structures in the scene. In stereo vision, repetitive structures may lead to “phan...
Björn Barrois, Marcus Konrad, Christian W&oum...
RTAS
2010
IEEE
13 years 5 months ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar
« Prev « First page 2110 / 2122 Last » Next »