Sciweavers

9 search results - page 1 / 2
» Optimal arrangement of data in a tree directory
Sort
View
DAM
2002
67views more  DAM 2002»
13 years 4 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 5 months ago
Data Fusion Trees for Detection: Does Architecture Matter?
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 3 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka
EDBT
2000
ACM
13 years 9 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 6 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch