3885 search results - page 715 / 777 » Clarifying Goal Models |
192
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
180
click to vote
ASAP
2011
IEEE
14 years 4 months ago
2011
IEEE
—The domain of vision and navigation often includes applications for feature tracking as well as simultaneous localization and mapping (SLAM). As these problems require computati...
146
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
138
click to vote
IACR
2011
14 years 4 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
169
click to vote
WSDM
2012
ACM
14 years 7 hour ago
2012
ACM
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...