Sciweavers

5158 search results - page 265 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
JCDL
2006
ACM
137views Education» more  JCDL 2006»
16 years 18 days ago
Exploring digital libraries: integrating browsing, searching, and visualization
Exploring services for digital libraries (DLs) include two major paradigms, browsing and searching, as well as other services such as clustering and visualization. In this paper, ...
Rao Shen, Naga Srinivas Vemuri, Weiguo Fan, Ricard...
PODC
2006
ACM
16 years 18 days ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 17 days ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
HT
2005
ACM
16 years 6 days ago
Mind the semantic gap
Hypertext can be seen as a logic representation, where semantics are encoded in both the textual nodes and the graph of links. Systems that have a very formal representation of th...
David E. Millard, Nicholas Gibbins, Danius T. Mich...
ATAL
2005
Springer
16 years 5 days ago
Negotiating over small bundles of resources
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Yann Chevaleyre, Ulle Endriss, Jérôme...