Sciweavers

1688 search results - page 228 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ICALP
1994
Springer
15 years 10 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
PVM
2000
Springer
15 years 10 months ago
Runtime Checking of Datatype Signatures in MPI
Abstract. The MPI standard provides a way to send and receive complex combinations of datatypes (e.g., integers and doubles) with a single communication operation. The MPI standard...
William Gropp
ICPR
2010
IEEE
15 years 8 months ago
Recognizing Human Actions Using Key Poses
In this paper, we explore the idea of using only pose, without utilizing any temporal information, for human action recognition. In contrast to the other studies using complex acti...
Sermetcan Baysal, Mehmet Can Kurt, Pinar Duygulu
IM
2007
15 years 7 months ago
Automated Availability Management Driven by Business Policies
—Policy-driven service management helps reduce IT management cost and it keeps the service management aligned with business objectives. While most of the previous research focuse...
Zhongtang Cai, Yuan Chen, Vibhore Kumar, Dejan S. ...
ECIS
2004
15 years 7 months ago
Information system and information infrastructure deployment: the challenge of the Italian e-justice approach
Information systems development methodologies are still mainly concerned with the research of better ways to provide technical solutions for given organizational problems. The pap...
Francesco Contini, Antonio Cordella