Sciweavers

149 search results - page 29 / 30
» Uniform hashing in constant time and linear space
Sort
View
COMPGEOM
2007
ACM
14 years 15 days ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
TSP
2008
157views more  TSP 2008»
13 years 8 months ago
A Two-Stage Approach to Estimate the Angles of Arrival and the Angular Spreads of Locally Scattered Sources
We propose a new two-stage approach to estimate the nominal angles of arrival (AoAs) and the angular spreads (ASs) of multiple locally scattered sources using a uniform linear arra...
Mehrez Souden, Sofiène Affes, Jacob Benesty
SIAMAM
2008
170views more  SIAMAM 2008»
13 years 8 months ago
Absolute Stability and Complete Synchronization in a Class of Neural Fields Models
Neural fields are an interesting option for modelling macroscopic parts of the cortex involving several populations of neurons, like cortical areas. Two classes of neural field equ...
Olivier D. Faugeras, François Grimbert, Jea...
INFOCOM
2005
IEEE
14 years 2 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic
JCO
2010
99views more  JCO 2010»
13 years 7 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein