Sciweavers

1015 search results - page 25 / 203
» An efficient algorithm for AS path inferring
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 8 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
13 years 12 months ago
On Label Stream Partition for Efficient Holistic Twig Join
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...
Bo Chen, Tok Wang Ling, M. Tamer Özsu, Zhenzh...
POPL
2011
ACM
12 years 11 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
IWEC
2008
13 years 9 months ago
Strategic Path Planning on the Basis of Risk vs. Time
Abstract. The selection of path in an urban combat setting determines the survival to a greater extent. In this paper we propose an algorithm that finds strategic paths inside a ma...
Ashish C. Singh, Lawrence B. Holder
ICNP
2003
IEEE
14 years 1 months ago
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
Chiping Tang, Philip K. McKinley