Sciweavers

8699 search results - page 155 / 1740
» Elements of the Theory of Computation
Sort
View
FOCS
1997
IEEE
15 years 3 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek
DOCENG
2004
ACM
15 years 5 months ago
Presenting the results of relevance-oriented search over XML documents
In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resu...
Alda Lopes Gançarski, Pedro Rangel Henrique...
HICSS
2003
IEEE
113views Biometrics» more  HICSS 2003»
15 years 4 months ago
Characteristics of IT Outsourcing Contracts
Once the decision to outsource an activity has been made, managers are faced with issues related to the management of the relationship with their service providers. A critical ele...
Benoit Aubert, Jean-Francois Houde, Michel Patry, ...
CORR
2008
Springer
64views Education» more  CORR 2008»
14 years 11 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin
CAGD
2004
122views more  CAGD 2004»
14 years 11 months ago
Axioms and variational problems in surface parameterization
For a surface patch on a smooth, two-dimensional surface in IR3 , low-distortion parameterizations are described in terms of minimizers of suitable energy functionals. Appropriate...
Ulrich Clarenz, Nathan Litke, Martin Rumpf