Sciweavers

235 search results - page 24 / 47
» Online Embeddings
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 2 days ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
LCTRTS
2007
Springer
15 years 6 months ago
Frequency-aware energy optimization for real-time periodic and aperiodic tasks
Energy efficiency is an important factor in embedded systems design. We consider an embedded system with a dynamic voltage scaling (DVS) capable processor and its system-wide pow...
Xiliang Zhong, Cheng-Zhong Xu
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 2 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ACSAC
2001
IEEE
15 years 3 months ago
Enabling Hierarchical and Bulk-Distribution for Watermarked Content
One of the solutions to deter copyright violations consists of embedding hard to detect watermarks in digital media. Current developments have focused on how to embed watermarks, ...
Germano Caronni, Christoph L. Schuba
CSCW
2010
ACM
15 years 4 months ago
Sending mixed signals: multilevel reputation effects in peer-to-peer lending markets
Online peer-to-peer (P2P) lending organizations enable an individual to obtain an unsecured loan from a collection of individuals without the participation of a bank. Previous res...
Benjamin C. Collier, Robert Hampshire