Sciweavers

146 search results - page 6 / 30
» A context-aware methodology for very small data base design
Sort
View
JCO
2010
101views more  JCO 2010»
13 years 5 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier

Publication
220views
15 years 7 months ago
Exploiting the Impact of Database System Configuration Parameters: A Design of Experiments Approach
Tuning database system configuration parameters to proper values according to the expected query workload plays a very important role in determining DBMS performance. However, the ...
Biplob K. Debnath, Mohamed F. Mokbel, David J. Lil...
INFOCOM
1992
IEEE
13 years 11 months ago
Topological Design of Interconnected LAN-MAN Networks
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
Cem Ersoy, Shivendra S. Panwar
INFOCOM
2006
IEEE
14 years 1 months ago
Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
Abhishek Kumar, Jun Xu
ITCC
2002
IEEE
14 years 7 days ago
Performance of KDB-Trees with Query-Based Splitting
While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on thes...
Yves Lépouchard, John L. Pfaltz, Ratko Orla...