Sciweavers

3946 search results - page 625 / 790
» The computational complexity of choice sets
Sort
View
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 10 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
AMDO
2000
Springer
15 years 10 months ago
Matching a Human Walking Sequence with a VRML Synthetic Model
- In this paper we present a specific matching technique based on basic motor patterns between two image sequences taken from different view points and a VRML synthetic human model...
Jose Maria Buades Rubio, Ramon Mas, Francisco J. P...
CASES
2005
ACM
15 years 8 months ago
Hardware support for code integrity in embedded processors
Computer security becomes increasingly important with continual growth of the number of interconnected computing platforms. Moreover, as capabilities of embedded processors increa...
Milena Milenkovic, Aleksandar Milenkovic, Emil Jov...
DEBS
2008
ACM
15 years 7 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
ECAI
2010
Springer
15 years 6 months ago
Optimal Task Migration in Service-Oriented Systems: Algorithms and Mechanisms
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...
Sebastian Stein, Enrico Gerding, Nicholas R. Jenni...