Sciweavers

774 search results - page 14 / 155
» Factors of generalized Fermat numbers
Sort
View
ALGORITHMICA
2011
14 years 4 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 2 days ago
From user comments to on-line conversations
We present an analysis of user conversations in on-line social media and their evolution over time. We propose a dynamic model that predicts the growth dynamics and structural pro...
Chunyan Wang, Mao Ye, Bernardo A. Huberman
TSP
2008
110views more  TSP 2008»
14 years 9 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 5 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximation schemes for multidimensional packing
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
José R. Correa, Claire Kenyon