2107 search results - page 177 / 422 » Computing Small Search Numbers in Linear Time |
158
click to vote
ANCS
2005
ACM
15 years 9 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
102
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider probabilistic methods to compute the near midair collision risk using state estimate and covariance from a target tracking filter based on angle-only sensors such as ...
125
click to vote
TELETRAFFIC
2007
Springer
15 years 9 months ago
2007
Springer
Multi-service mesh networks allow existence of guaranteed delay Quality-of-Service (QoS) traffic streams such as Voice over IP and best effort QoS traffic streams such as file tr...
121
click to vote
SAC
2008
ACM
15 years 3 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
114
Voted
PVLDB
2010
15 years 2 months ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...