Sciweavers

406 search results - page 44 / 82
» Dominating Sets in Web Graphs
Sort
View
VLDB
2000
ACM
125views Database» more  VLDB 2000»
14 years 18 days ago
Focused Crawling Using Context Graphs
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
Michelangelo Diligenti, Frans Coetzee, Steve Lawre...
OTM
2009
Springer
14 years 3 months ago
LinksB2N: Automatic Data Integration for the Semantic Web
Abstract. The ongoing trend towards open data embraced by the Semantic Web has started to produce a large number of data sources. These data sources are published using RDF vocabul...
Manuel Salvadores, Gianluca Correndo, Bene Rodrigu...
EJC
2011
13 years 4 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
COMCOM
2006
89views more  COMCOM 2006»
13 years 9 months ago
Quantifying the effects of recent protocol improvements to TCP: Impact on Web performance
We assess the state of Internet congestion control and error recovery through a controlled study that considers the integration of standards-track TCP error recovery and both TCP ...
Michele C. Weigle, Kevin Jeffay, F. Donelson Smith
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...