4908 search results - page 795 / 982 » On the Complexity of Optimal K-Anonymity |
186
click to vote
HIPEAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
201
click to vote
SEMWEB
2009
Springer
15 years 11 months ago
2009
Springer
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
165
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
158
click to vote
EVOW
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
136
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
This paper introduces a data-driven process for designing and fabricating materials with desired deformation behavior. Our process starts with measuring deformation properties of ...