4908 search results - page 739 / 982 » On the Complexity of Optimal K-Anonymity |
188
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
172
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
213
click to vote
ACML
2009
Springer
16 years 1 months ago
2009
Springer
Real-world face recognition systems are sometimes confronted with degraded face images, e.g., low-resolution, blurred, and noisy ones. Traditional two-step methods have limited per...
220
click to vote
AI
2009
Springer
16 years 1 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
151
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...