4908 search results - page 263 / 982 » On the Complexity of Optimal K-Anonymity |
162
click to vote
SCCC
1998
IEEE
15 years 11 months ago
1998
IEEE
Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its inte...
162
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
205
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
160
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
203
click to vote
EMNETS
2007
15 years 10 months ago
2007
Laparoscopic surgical training is a challenging task due to the complexity of instrument control and demand on manual dexterity and hand-eye coordination. Currently, training and ...