963 search results - page 169 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
69
Voted
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...
72
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
80
Voted
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
156
click to vote
GIS
2009
ACM
15 years 10 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
78
Voted
IPSN
2007
Springer
15 years 3 months ago
2007
Springer
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...