3360 search results - page 453 / 672 » Opportunistic Data Structures with Applications |
128
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
139
Voted
WEBDB
2009
Springer
15 years 11 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
142
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
128
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
126
click to vote
PVM
2009
Springer
15 years 11 months ago
2009
Springer
The MPI datatype functionality provides a powerful tool for describing structured memory and file regions in parallel applications, enabling noncontiguous data to be operated on b...