4007 search results - page 256 / 802 » Computation with imprecise probabilities |
127
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
170
click to vote
EDBT
2010
ACM
15 years 6 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
158
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
143
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
142
click to vote
WIOPT
2010
IEEE
15 years 2 months ago
2010
IEEE
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...