Sciweavers

1760 search results - page 274 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 8 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
ATAL
2006
Springer
13 years 11 months ago
Forming efficient agent groups for completing complex tasks
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
Efrat Manisterski, Esther David, Sarit Kraus, Nich...
SIGECOM
2011
ACM
311views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
The role of social networks in online shopping: information passing, price of trust, and consumer choice
While social interactions are critical to understanding consumer behavior, the relationship between social and commerce networks has not been explored on a large scale. We analyze...
Stephen Guo, Mengqiu Wang, Jure Leskovec
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 8 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
PEPM
1994
ACM
13 years 12 months ago
Partial Evaluation of Numerical Programs in Fortran
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
Romana Baier, Robert Glück, Robert Zöchl...