Sciweavers

231 search results - page 19 / 47
» On overlays and minimization diagrams
Sort
View
NPC
2004
Springer
15 years 3 months ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
DSN
2004
IEEE
15 years 1 months ago
Robust Aggregation Protocols for Large-Scale Overlay Networks
Aggregation refers to a set of functions that provide global information about a distributed system. These functions operate on numeric values distributed over the system and can ...
Alberto Montresor, Márk Jelasity, Özal...
ADBIS
2003
Springer
194views Database» more  ADBIS 2003»
15 years 2 months ago
Rule-Based Generation of XML DTDs from UML Class Diagrams
We present an approach of how to extract automatically an XML document structure from a conceptual data model that describes the content of a document. We use UML class diagrams as...
Thomas Kudrass, Tobias Krumbein
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
14 years 11 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
EOR
2011
140views more  EOR 2011»
14 years 4 months ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus