Sciweavers

3466 search results - page 96 / 694
» Fast computation of special resultants
Sort
View
STACS
2004
Springer
15 years 6 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
106
Voted
NCA
2003
IEEE
15 years 6 months ago
SWIFT: Scheduling in Web Servers for Fast Response Time
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remain...
Mayank Rawat, Ajay D. Kshemkalyani
118
Voted
DAC
2003
ACM
15 years 6 months ago
Fast timing-driven partitioning-based placement for island style FPGAs
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
Pongstorn Maidee, Cristinel Ababei, Kia Bazargan
125
Voted
MOBIHOC
2000
ACM
15 years 5 months ago
Proximity awareness and fast connection establishment in Bluetooth
Bluetooth is a promising new technology that enables portable devices to form short-range wireless ad hoc networks and relies on spread spectrum frequency hopping (FH) techniques f...
Theodoros Salonidis, Pravin Bhagwat, Leandros Tass...
84
Voted
HPCA
1998
IEEE
15 years 5 months ago
Exploiting Two-Case Delivery for Fast Protected Messaging
We propose and evaluate two complementary techniques to protect and virtualize a tightly-coupled network interface in a multicomputer. The techniques allow efficient, direct appli...
Kenneth Mackenzie, John Kubiatowicz, Matthew Frank...