Sciweavers

2766 search results - page 285 / 554
» Algorithms for trigonometric polynomials
Sort
View
151
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
15 years 2 days ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 8 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
INFOCOM
2012
IEEE
13 years 7 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
INFOCOM
2012
IEEE
13 years 7 months ago
Strategizing surveillance for resource-constrained event monitoring
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
Xi Fang, Dejun Yang, Guoliang Xue
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 5 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...