316 search results - page 19 / 64 » On Approximate Majority and Probabilistic Time |
ETT
2002
14 years 9 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
101
click to vote
ISPD
2005
ACM
15 years 3 months ago
2005
ACM
The sustained progress of VLSI technology has altered the landscape of routing which is a major physical design stage. For timing driven routings, traditional approaches which con...
CN
2002
14 years 9 months ago
2002
We present a model for soft handoff in wireless cellular networks. In such networks, due to overlapping cells, handoffs are not instantaneous and multiple channels may be occupied...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
121
click to vote
EDBT
2006
ACM
15 years 1 months ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...