Sciweavers

208 search results - page 19 / 42
» Improved upper bounds on the crossing number
Sort
View
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 5 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
ADHOCNOW
2008
Springer
13 years 8 months ago
A Lower Bound on the Capacity of Wireless Ad Hoc Networks with Cooperating Nodes
In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper b...
Anthony S. Acampora, Louisa Pui Sum Ip
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
ICC
2009
IEEE
120views Communications» more  ICC 2009»
13 years 5 months ago
Achieving Exponential Diversity in Wireless Multihop Systems with Regenerative Relays
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
Andreas Müller 0001, Joachim Speidel