Sciweavers

80 search results - page 11 / 16
» A fast cost scaling algorithm for submodular flow
Sort
View
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
14 years 29 days ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
Filippo Geraci, Roberto Grossi
VLDB
2004
ACM
178views Database» more  VLDB 2004»
14 years 25 days ago
High-Dimensional OLAP: A Minimal Cubing Approach
Data cube has been playing an essential role in fast OLAP (online analytical processing) in many multi-dimensional data warehouses. However, there exist data sets in applications ...
Xiaolei Li, Jiawei Han, Hector Gonzalez
ICDE
2003
IEEE
144views Database» more  ICDE 2003»
14 years 8 months ago
Scalable template-based query containment checking for web semantic caches
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...
Khalil Amiri, Sanghyun Park, Renu Tewari, Sriram P...
SIAMSC
2008
131views more  SIAMSC 2008»
13 years 7 months ago
Fast Monte Carlo Simulation Methods for Biological Reaction-Diffusion Systems in Solution and on Surfaces
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
Rex A. Kerr, Thomas M. Bartol, Boris Kaminsky, Mar...
ICML
2006
IEEE
14 years 8 months ago
Robust Euclidean embedding
We derive a robust Euclidean embedding procedure based on semidefinite programming that may be used in place of the popular classical multidimensional scaling (cMDS) algorithm. We...
Lawrence Cayton, Sanjoy Dasgupta