Sciweavers

853 search results - page 167 / 171
» Anycasting in connection-oriented computer networks: Models,...
Sort
View
BMCBI
2008
208views more  BMCBI 2008»
13 years 7 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
CCS
2010
ACM
13 years 5 months ago
The limits of automatic OS fingerprint generation
Remote operating system fingerprinting relies on implementation differences between OSs to identify the specific variant executing on a remote host. Because these differences can ...
David W. Richardson, Steven D. Gribble, Tadayoshi ...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 8 months ago
Sustainable operation and management of data center chillers using temporal data mining
Motivation: Data centers are a critical component of modern IT infrastructure but are also among the worst environmental offenders through their increasing energy usage and the re...
Debprakash Patnaik, Manish Marwah, Ratnesh K. Shar...
DAC
1997
ACM
13 years 11 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter