3244 search results - page 540 / 649 » On convex complexity measures |
195
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
167
click to vote
PADS
2004
ACM
15 years 11 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
180
click to vote
EMSOFT
2004
Springer
15 years 11 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
192
click to vote
ECCV
2010
Springer
2010
Springer
Backprojection Revisited: Scalable Multi-view Object Detection and Similarity Metrics for Detections
15 years 11 months ago
Hough transform based object detectors learn a mapping from the image domain to a Hough voting space. Within this space, object hypotheses are formed by local maxima. The votes con...
184
click to vote
NETGAMES
2003
ACM
15 years 11 months ago
2003
ACM
Plenty of work was contributed in the field of protocol design and performance evaluation of multi-hop networks. It is generally accepted that mobility has a huge impact on the p...