Sciweavers

9842 search results - page 1504 / 1969
» Problem complexity
Sort
View
KCAP
2005
ACM
16 years 17 days ago
Semantic Association of Taxonomy-based Standards Using Ontology
The vision of semantic interoperability, the fluid sharing of digitalized knowledge, has led much research on ontology/schema mapping/aligning. Although this line of research is f...
Hung-Ju Chu, Randy Y. C. Chow, Su-Shing Chen, Raja...
MOBICOM
2005
ACM
16 years 17 days ago
An analytical model for the dimensioning of a GPRS/EDGE network with a capacity constraint on a group of cells
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...
Georges Nogueira, Bruno Baynat, Pierre Eisenmann
CSCW
2004
ACM
16 years 13 days ago
Field studies of computer system administrators: analysis of system management tools and practices
Computer system administrators are the unsung heroes of the information age, working behind the scenes to configure, maintain, and troubleshoot the computer infrastructure that un...
Rob Barrett, Eser Kandogan, Paul P. Maglio, Eben M...
IUI
2004
ACM
16 years 13 days ago
Sheepdog: learning procedures for technical support
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
Tessa A. Lau, Lawrence D. Bergman, Vittorio Castel...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 12 days ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
« Prev « First page 1504 / 1969 Last » Next »