Sciweavers

4908 search results - page 211 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ATAL
2007
Springer
16 years 23 days ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
COMSWARE
2006
IEEE
15 years 10 months ago
Architecting protocol stack optimizations on mobile devices
Applications using traditional protocol stacks (e.g TCP/IP) from wired networks do not function efficiently in mobile wireless scenarios. This is primarily due to the layered archi...
Vijay T. Raisinghani, Sridhar Iyer
PAMI
1998
84views more  PAMI 1998»
15 years 6 months ago
Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps
A new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is to rst extract a low-d...
Jörg Bruske, Gerald Sommer
SASO
2010
IEEE
15 years 4 months ago
Designing Comprehensible Self-Organising Systems
Self-organising systems are a popular engineering concept for designing decentralised autonomic computing systems. They are able to find solutions in complex and versatile problem ...
Nicolas Höning, Han La Poutré
HCI
2009
15 years 4 months ago
Can Neurophysiologic Synchronies Provide a Platform for Adapting Team Performance?
We have explored using neurophysiologic patterns as an approach for developing a deeper understanding of how teams collaborate when solving time-critical, complex real-world proble...
Ronald H. Stevens, Trysha Galloway, Chris Berka, M...