Sciweavers

951 search results - page 33 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
15 years 2 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
IM
2007
14 years 10 months ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...
WIOPT
2010
IEEE
14 years 8 months ago
Virtual MIMO network a physical wireless analysis
By analogy with an approach widely used in physics, we consider a discrete set of base stations (BS) as a continuum of transmitters. This model allows us to establish a simple clos...
Jean Marc Kelif
WIOPT
2010
IEEE
14 years 8 months ago
Iterative power and subcarrier allocation for maximizing WSMR in cellular OFDMA systems
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
Tao Wang, Luc Vandendorpe
ICDAR
2009
IEEE
14 years 8 months ago
Italic or Roman: Word Style Recognition without A Priori Knowledge for Old Printed Documents
This paper presents an Italic/Roman word type recognition system without a priori knowledge on the characters' font. This method aims at analyzing old documents in which char...
Loris Eynard, Hubert Emptoz