4908 search results - page 305 / 982 » On the Complexity of Optimal K-Anonymity |
230
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
166
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
172
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Enterprise networks are increasingly adopting Layer 3 Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) technology to connect geographically disparate locations...
164
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
172
Voted
DASFAA
2008
IEEE
16 years 1 months ago
2008
IEEE
View updating is a long standing difficult problem. Given a view defined over base data sources and a view update, there are several different updates over the base data sources,...