Sciweavers

6274 search results - page 208 / 1255
» From query complexity to computational complexity
Sort
View
IEEEARES
2007
IEEE
15 years 11 months ago
Secure, Resilient Computing Clusters: Self-Cleansing Intrusion Tolerance with Hardware Enforced Security (SCIT/HES)
The formidable difficulty in securing systems stems in large part from the increasing complexity of the systems we build but also the degree to which we now depend on information ...
David Arsenault, Arun Sood, Yih Huang
ICSOFT
2008
15 years 6 months ago
An Architecture for Non Functional Properties Management in Distributed Computing
One of the primary benefits of Service Oriented Architecture (SOA) [1] is the ability to compose applications, processes or more complex services from other services. As the comple...
Pierre de Leusse, Panos Periorellis, Theodosis Dim...
COGSCI
2004
97views more  COGSCI 2004»
15 years 4 months ago
A rhythm recognition computer program to advocate interactivist perception
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
Jean-Christophe Buisson
ICDCS
2009
IEEE
16 years 1 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
ICALP
2007
Springer
15 years 10 months ago
Constant-Round Private Database Queries
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
Nenad Dedic, Payman Mohassel