Sciweavers

3008 search results - page 413 / 602
» Independence in connected graphs
Sort
View
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
16 years 8 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...
OSDI
2004
ACM
16 years 7 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
MSWIM
2009
ACM
16 years 1 months ago
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
Shabbir Ahmed, Salil S. Kanhere
INFOCOM
2009
IEEE
16 years 1 months ago
Assessing the Vulnerability of the Fiber Infrastructure to Disasters
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...
Sebastian Neumayer, Gil Zussman, Reuven Cohen, Eyt...
IAT
2008
IEEE
16 years 1 months ago
Adapting to Changing Resource Requirements for Coalition Formation in Self-Organized Social Networks
Coalition formation in social networks, consisting of a graph of interdependent agents, allows many choices of which task to select and with whom to partner in the social network....
Levi Barton, Vicki H. Allan