Sciweavers

968 search results - page 8 / 194
» A faster implementation of APlace
Sort
View
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
14 years 25 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
PAPM
2001
Springer
128views Mathematics» more  PAPM 2001»
13 years 11 months ago
Faster and Symbolic CTMC Model Checking
Abstract. This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (...
Joost-Pieter Katoen, Marta Z. Kwiatkowska, Gethin ...
USENIX
2003
13 years 8 months ago
Kernel Support for Faster Web Proxies
This paper proposes two mechanisms for reducing the communication-related overheads of Web applications. One mechanism is user-level connection tracking, which allows an applicati...
Marcel-Catalin Rosu, Daniela Rosu
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 8 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
DATE
2009
IEEE
85views Hardware» more  DATE 2009»
14 years 2 months ago
Faster SAT solving with better CNF generation
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
Benjamin Chambers, Panagiotis Manolios, Daron Vroo...