Sciweavers

6251 search results - page 288 / 1251
» Randomness, Computability, and Density
Sort
View
CVPR
2009
IEEE
15 years 10 months ago
Fast human detection in crowded scenes by contour integration and local shape estimation
The complexity of human detection increases significantly with a growing density of humans populating a scene. This paper presents a Bayesian detection framework using shape and m...
Csaba Beleznai, Horst Bischof
FOCS
2004
IEEE
15 years 10 months ago
Measured Descent: A New Embedding Method for Finite Metrics
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...
Robert Krauthgamer, James R. Lee, Manor Mendel, As...
TMC
2008
127views more  TMC 2008»
15 years 6 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
COMPSAC
2008
IEEE
16 years 1 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
MSWIM
2005
ACM
16 years 6 days ago
Hop distances and flooding in wireless multihop networks with randomized beamforming
We show that randomized beamforming is a simple yet efficient communication strategy in wireless multihop networks if no neighbor location information is at hand. Already small an...
Robert Vilzmann, Christian Bettstetter, Daniel Med...