Sciweavers

4850 search results - page 180 / 970
» Approximate Data Structures with Applications
Sort
View
CCE
2004
15 years 6 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
IMC
2007
ACM
15 years 7 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 6 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
TELETRAFFIC
2007
Springer
16 years 10 days ago
Modeling and Predicting End-to-End Response Times in Multi-tier Internet Applications
Many Internet applications employ multi-tier software architectures. The performance of such multi-tier Internet applications is typically measured by the end-toend response times...
Sandjai Bhulai, Swaminathan Sivasubramanian, Rober...
CIKM
2010
Springer
15 years 4 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...