Sciweavers

1718 search results - page 5 / 344
» Communicating more than nothing
Sort
View
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
13 years 11 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
ICC
2007
IEEE
115views Communications» more  ICC 2007»
13 years 11 months ago
Efficient Estimation of More Detailed Internet IP Maps
Router-level maps of the Internet implicate a large body of research on network management, overlay networks, performance evaluation, and security. The inaccuracies in these maps r...
Sangmin Kim, Khaled Harfoush
ICSEA
2006
IEEE
14 years 1 months ago
Reflection: Improving Research through Knowledge Transfer
— It is through our mental models of the world that we understand it. Advances in science are nothing more than improvements to the model. This paper presents the development and...
Andre Oboler, Simon Lock, Ian Sommerville
GMP
2003
IEEE
14 years 1 months ago
Extensible Point Location Algorithm
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...
Rashmi Sundareswara, Paul R. Schrater
SIGECOM
2004
ACM
104views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
An economic answer to unsolicited communication
We explore an alternative approach to spam based on economic rather than technological or regulatory screening mechanisms. We employ a model of email value which supports two intu...
Thede Loder, Marshall W. van Alstyne, Rick Wash