Sciweavers

1162 search results - page 227 / 233
» Requirements for Routing in the Application Layer
Sort
View
90
Voted
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
15 years 9 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
MOBISYS
2008
ACM
15 years 9 months ago
Brimon: a sensor network system for railway bridge monitoring
: Railway systems are critical in many regions, and can consist of several tens of thousands of bridges, being used over several decades. It is critical to have a system to monitor...
Kameswari Chebrolu, Bhaskaran Raman, Nilesh Mishra...
MOBIHOC
2004
ACM
15 years 9 months ago
Towards mobility as a network control primitive
In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlle...
David Kiyoshi Goldenberg, Jie Lin, A. Stephen Mors...
WWW
2010
ACM
15 years 4 months ago
Mind the data skew: distributed inferencing by speeddating in elastic regions
Semantic Web data exhibits very skewed frequency distributions among terms. Efficient large-scale distributed reasoning methods should maintain load-balance in the face of such hi...
Spyros Kotoulas, Eyal Oren, Frank van Harmelen
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
15 years 4 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits