Sciweavers

445 search results - page 10 / 89
» Recco: recombination analysis using cost optimization
Sort
View
P2P
2009
IEEE
231views Communications» more  P2P 2009»
15 years 4 months ago
Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectari...
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
14 years 11 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
INFOCOM
2005
IEEE
15 years 3 months ago
Optimal ISP subscription for Internet multihoming: algorithm design and implication analysis
— Multihoming is a popular method used by large enterprises and stub ISPs to connect to the Internet to reduce cost and improve performance. Recently researchers have studied the...
Hao Wang, Haiyong Xie 0002, Lili Qiu, Abraham Silb...
ICA
2010
Springer
14 years 8 months ago
Non-negative Independent Component Analysis Algorithm Based on 2D Givens Rotations and a Newton Optimization
Abstract. In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-lin...
Wendyam Serge Boris Ouedraogo, Antoine Souloumiac,...
DKE
2006
123views more  DKE 2006»
14 years 10 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...