Sciweavers

12659 search results - page 2346 / 2532
» The distributed breakout algorithms
Sort
View
WSNA
2003
ACM
15 years 11 months ago
Lightweight time synchronization for sensor networks
This paper presents lightweight tree-based synchronization (LTS) methods for sensor networks. First, a single-hop, pair-wise synchronization scheme is analyzed. This scheme requir...
Jana van Greunen, Jan M. Rabaey
CGO
2010
IEEE
15 years 11 months ago
Taming hardware event samples for FDO compilation
Feedback-directed optimization (FDO) is effective in improving application runtime performance, but has not been widely adopted due to the tedious dual-compilation model, the dif...
Dehao Chen, Neil Vachharajani, Robert Hundt, Shih-...
COMPGEOM
2010
ACM
15 years 11 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 11 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 11 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
« Prev « First page 2346 / 2532 Last » Next »