Sciweavers

2498 search results - page 169 / 500
» Data Structures with Unpredictable Timing
Sort
View
CCCG
2008
14 years 11 months ago
Core-Preserving Algorithms
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
Hamid Zarrabi-Zadeh
ICANN
2010
Springer
14 years 11 months ago
Kernel-Based Learning from Infinite Dimensional 2-Way Tensors
Abstract. In this paper we elaborate on a kernel extension to tensorbased data analysis. The proposed ideas find applications in supervised learning problems where input data have ...
Marco Signoretto, Lieven De Lathauwer, Johan A. K....
IPSN
2007
Springer
15 years 4 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 16 days ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
IKE
2010
14 years 8 months ago
Active Datawarehouse Loading by Tool Based ETL Procedure
: Over the years, DataWarehousing has gone through a number of evolutions from a relatively simple reporting database to sophisticated analytical applications such as analyzing cus...
Mallikharjuna Reddy V, Sanjay K. Jena