Sciweavers

951 search results - page 20 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
127
Voted
ICALP
2003
Springer
15 years 9 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
120
Voted
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
15 years 3 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
129
Voted
ICRA
2005
IEEE
148views Robotics» more  ICRA 2005»
15 years 9 months ago
Bearing-only SLAM Using a SPRT Based Gaussian Sum Filter
— Use of a Gaussian Sum filter (GSF) to efficiently solve the initialisation problem in bearing-only simultaneous localisation and mapping (SLAM) is the main contribution of th...
Ngai Ming Kwok, Gamini Dissanayake, Q. P. Ha
120
Voted
INFSOF
2007
98views more  INFSOF 2007»
15 years 3 months ago
Indexing range sum queries in spatio-temporal databases
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving ob...
Hyung-Ju Cho, Chin-Wan Chung
120
Voted
WIOPT
2005
IEEE
15 years 9 months ago
Interference Power Sum with Log-Normal Components in Ad-Hoc and Sensor Networks
The log-normal shadowing radio model has frequently been used to model radio propagation conditions. There exist accurate calculation methods for estimation of interference power ...
Ramin Hekmat, Piet Van Mieghem