Sciweavers

23119 search results - page 4253 / 4624
» From Domain to Requirements
Sort
View
PODS
2012
ACM
281views Database» more  PODS 2012»
13 years 9 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
INFOCOM
2012
IEEE
13 years 9 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
INFOCOM
2012
IEEE
13 years 9 months ago
Data gathering in networks of bacteria colonies: Collective sensing and relaying using molecular communication
Abstract—The prospect of new biological and industrial applications that require communication in micro-scale, encourages research on the design of bio-compatible communication n...
Arash Einolghozati, Mohsen Sardari, Ahmad Beirami,...
SIGIR
2012
ACM
13 years 9 months ago
Time-based calibration of effectiveness measures
Many current effectiveness measures incorporate simplifying assumptions about user behavior. These assumptions prevent the measures from reflecting aspects of the search process...
Mark D. Smucker, Charles L. A. Clarke
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 9 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
« Prev « First page 4253 / 4624 Last » Next »