549 search results - page 91 / 110 » On the Complexity of Restricted k-anonymity Problem |
109
click to vote
ATAL
1997
Springer
15 years 2 months ago
1997
Springer
Incorporating coalition formation algorithms into agent systems shall be advantageous due to the consequent increase in the overall quality of task performance. Coalition formatio...
SIGCOMM
1996
ACM
15 years 1 months ago
1996
ACM
Wormhole routing LANs are emerging as an effective solution for high-bandwidth, low-latency interconnects in distributed computing and cluster computing applications. An important...
SMA
1995
ACM
15 years 1 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Recovering the 3D shape of deformable surfaces from single images is difficult because many different shapes have very similar projections. This is commonly addressed by restricti...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...