Sciweavers

4526 search results - page 47 / 906
» Algorithmic problems related to the Internet
Sort
View
ICPP
2005
IEEE
14 years 2 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 24 days 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...
ASWC
2009
Springer
14 years 3 months ago
Supporting the Development of Data Wrapping Ontologies
Abstract. We consider the problem of designing data wrapping ontologies whose purpose is to describe relational data sources and to provide a semantically enriched access to the un...
Lina Lubyte, Sergio Tessaris
CEAS
2006
Springer
14 years 13 days ago
Algorithmically Determining Store-and-Forward MTA Relays Using DomainKeys
Store-and-forward MTA relaying servers have frequently presented problems to various antispam techniques, such as IPbased reputation or email authentication. Algorithms that find ...
Miles Libbey, Peter Ludemann
INFOCOM
1999
IEEE
14 years 29 days ago
Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
Isabella Chang, Robert Engel, Dilip D. Kandlur, Di...