Sciweavers

1265 search results - page 29 / 253
» Finding the Key to a Synapse
Sort
View
HICSS
2005
IEEE
161views Biometrics» more  HICSS 2005»
14 years 1 months ago
Data Assurance in a Conventional File Systems
The goal of this research is to find a mechanism to guarantee that a file stored in a conventional file system, on disk, has not been modified. Our proposal for achieving that goa...
Sasa Rudan, Aleksandra Kovacevic, Charles A. Milli...
EDBTW
2004
Springer
14 years 1 months ago
A Query-Adaptive Partial Distributed Hash Table for Peer-to-Peer Systems
The two main approaches to find data in peer-to-peer (P2P) systems are unstructured networks using flooding and structured networks using a distributed index. A distributed index i...
Fabius Klemm, Anwitaman Datta, Karl Aberer
TCS
2008
13 years 7 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
HICSS
2008
IEEE
161views Biometrics» more  HICSS 2008»
14 years 2 months ago
IT Business Alignment as Governance Tool for Firm-Internal Relationship Quality: A Longitudinal Case Study
Many business processes are relying on a smooth and flexible IT support. A major finding of IS research is that in order to generate value from IT the complementarities between IT...
Heinz-Theo Wagner, Tim Weitzel
JAR
2006
107views more  JAR 2006»
13 years 7 months ago
Attacking Group Protocols by Refuting Incorrect Inductive Conjectures
Automated tools for finding attacks on flawed security protocols often fail to quately with group protocols. This is because the abstractions made to improve performance on fixed ...
Graham Steel, Alan Bundy