Sciweavers

4171 search results - page 517 / 835
» Choice numbers of graphs
Sort
View
CORR
2007
Springer
96views Education» more  CORR 2007»
15 years 6 months ago
Understanding the Properties of the BitTorrent Overlay
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...
Anwar Al Hamra, Arnaud Legout, Chadi Barakat
ORDER
2008
61views more  ORDER 2008»
15 years 6 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
257
Voted
VLDB
2007
ACM
103views Database» more  VLDB 2007»
16 years 7 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
249
Voted
SIGMOD
2008
ACM
109views Database» more  SIGMOD 2008»
16 years 6 months ago
Cooperative XPath caching
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...
Kostas Lillis, Evaggelia Pitoura
SIGCOMM
2006
ACM
16 years 21 days ago
Building an AS-topology model that captures route diversity
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
Wolfgang Mühlbauer, Anja Feldmann, Olaf Maenn...