Sciweavers

1220 search results - page 144 / 244
» Minimal Interval Completions
Sort
View
AAAI
2006
13 years 10 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
CIC
2004
106views Communications» more  CIC 2004»
13 years 10 months ago
Some Properties of Swapped Interconnection Networks
Interconnection architectures range from complete networks, that have a diameter of D = 1 but are impractical except when the number n of nodes is small, to low-cost, minimally co...
Behrooz Parhami
DC
2001
13 years 10 months ago
A Metadata Kernel for Electronic Permanence
This paper presents a streamlined metadata record format designed to support the permanence of network discoverable objects. It starts with the Dublin Core consensus and distills ...
John A. Kunze
CATA
2003
13 years 10 months ago
Efficient Even Distribution of Power Consumption in Wireless Sensor Networks
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the e...
Ioan Raicu
GVD
2001
142views Database» more  GVD 2001»
13 years 10 months ago
An approach to the model-based fragmentation and relational storage of XML-documents
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
Christian Süß