Sciweavers

874 search results - page 174 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
ISPD
2005
ACM
188views Hardware» more  ISPD 2005»
14 years 1 months ago
A semi-persistent clustering technique for VLSI circuit placement
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
Charles J. Alpert, Andrew B. Kahng, Gi-Joon Nam, S...
IPPS
2003
IEEE
14 years 23 days ago
Applying Aspect-Orient Programming Concepts to a Component-Based Programming Model
Abstract— The execution environments For scientific applications have evolved significantly over the years. Vector and parallel architectures have provided significantly faste...
Thomas Eidson, Jack Dongarra, Victor Eijkhout
WINET
2002
163views more  WINET 2002»
13 years 7 months ago
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
Claudio Casetti, Mario Gerla, Saverio Mascolo, M. ...