Sciweavers

6224 search results - page 1017 / 1245
» Recent Advances in Networking
Sort
View
NDSS
2003
IEEE
15 years 10 months ago
Moderately Hard, Memory-Bound Functions
A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. It has been sugge...
Martín Abadi, Michael Burrows, Ted Wobber
MOBICOM
2003
ACM
15 years 9 months ago
Geographic routing without location information
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e....
Ananth Rao, Christos H. Papadimitriou, Scott Shenk...
SLIP
2003
ACM
15 years 9 months ago
Fast estimation of the partitioning rent characteristic using a recursive partitioning model
In the past, a priori interconnect prediction, based on Rent’s rule, has been applied mainly for technology evaluation and roadmap applications. These applications do not requir...
Joni Dambre, Dirk Stroobandt, Jan Van Campenhout
AINA
2009
IEEE
15 years 9 months ago
Do Metrics Make Recommender Algorithms?
Recommender systems are used to suggest customized products to users. Most recommender algorithms create collaborative models by taking advantage of web user profiles. In the las...
Elica Campochiaro, Riccardo Casatta, Paolo Cremone...
DSN
2002
IEEE
15 years 9 months ago
Reducing Recovery Time in a Small Recursively Restartable System
We present ideas on how to structure software systems for high availability by considering MTTR/MTTF characteristics of components in addition to the traditional criteria, such as...
George Candea, James Cutler, Armando Fox, Rushabh ...
« Prev « First page 1017 / 1245 Last » Next »