501 search results - page 76 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Given a fixed network where each node has some given initial value, and under the constraint that each node receives noisy transmissions from its immediate neighbors, we provi...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
PADS
1999
ACM
13 years 12 months ago
1999
ACM
We have developed a set of performance prediction tools which help to estimate the achievable speedups from parallelizing a sequential simulation. The tools focus on two important...
ASPDAC
1998
ACM
13 years 11 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...