Sciweavers

846 search results - page 148 / 170
» Fundamentals of Media Theory
Sort
View
PODC
2005
ACM
14 years 29 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
SIGCOMM
2004
ACM
14 years 25 days ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
DAGM
2003
Springer
14 years 19 days ago
Splines and Wavelets: New Perspectives for Pattern Recognition
We provide an overview of spline and wavelet techniques with an emphasis on applications in pattern recognition. The presentation is divided in three parts. In the first one, we ar...
Michael Unser
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 7 days ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 7 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...