820 search results - page 73 / 164 » Finding low-utility data structures |
ALGORITHMICA
2010
13 years 9 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
NN
2000
Springer
13 years 8 months ago
2000
Springer
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
ACL
2008
13 years 10 months ago
2008
Relation extraction is the task of finding semantic relations between two entities from text. In this paper, we propose a novel feature-based Chinese relation extraction approach ...