Sciweavers

3663 search results - page 729 / 733
» Problems in the ontology of computer programs
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
APCSAC
2006
IEEE
14 years 2 months ago
A High Performance Simulator System for a Multiprocessor System Based on a Multi-way Cluster
In the ubiquitous era, it is necessary to research the architectures of multiprocessor system with high performance and low power consumption. A simulator developed in high level l...
Arata Shinozaki, Masatoshi Shima, Minyi Guo, Mitsu...
TGC
2005
Springer
14 years 2 months ago
Types for Security in a Mobile World
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acade...
Adriana B. Compagnoni, Elsa L. Gunter
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
EDOC
2003
IEEE
14 years 1 months ago
How MDA Can Help Designing Component- and Aspect-based Applications
Distributed systems are inherently complex, and therefore difficult to design and develop. Experience shows that new technologies—such as components, aspects, and application f...
Lidia Fuentes, Mónica Pinto, Antonio Vallec...