Sciweavers

CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 8 months ago
Relay vs. User Cooperation in Time-Duplexed Multiaccess Networks
The performance of user-cooperation in a multi-access network is compared to that of using a wireless relay. Using the total transmit and processing power consumed at all nodes as...
Lalitha Sankar, Gerhard Kramer, Narayan B. Mandaya...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
On (Omega-)Regular Model Checking
Axel Legay, Pierre Wolper
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 8 months ago
Fairness in Combinatorial Auctioning Systems
One of the Multi-Agent Systems that is widely used by various government agencies, buyers and sellers in a market economy, in such a manner so as to attain optimized resource allo...
Megha Saini, Shrisha Rao
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 8 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 8 months ago
Materialized View Selection by Query Clustering in XML Data Warehouses
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native XML database management systems currently bear limited p...
Hadj Mahboubi, Kamel Aouiche, Jérôme ...
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 8 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 8 months ago
C-K-R Partitions of Sparse Graphs
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
Manor Mendel, Chaya Schwob
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 8 months ago
Improved Smoothed Analysis of the k-Means Method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
Bodo Manthey, Heiko Röglin