Sciweavers

2266 search results - page 185 / 454
» Some Solutions to the Ignoring Problem
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 10 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 4 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
PERCOM
2004
ACM
16 years 6 months ago
One-Time Capabilities for Authorizations without Trust
This paper introduces and solves a security problem of pervasive computing: how to define authorizations for offline interactions when trust relationships among entities do not ex...
Laurent Bussard, Refik Molva
ICC
2008
IEEE
112views Communications» more  ICC 2008»
16 years 1 months ago
Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
Javad Ghaderi, Liang-Liang Xie, Xuemin Shen
ICPR
2008
IEEE
16 years 1 months ago
RANSAC-SVM for large-scale datasets
Support Vector Machines (SVMs), though accurate, are still difficult to solve large-scale applications, due to the computational and storage requirement. To relieve this problem,...
Kenji Watanabe, Takio Kurita