Sciweavers

515 search results - page 99 / 103
» Classroom Examples of Robustness Problems in Geometric Compu...
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 7 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
111
Voted
ICCV
1995
IEEE
15 years 5 months ago
Fast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
Margrit Betke, Nicholas C. Makris
ECCB
2008
IEEE
15 years 8 months ago
Connect the dots: exposing hidden protein family connections from the entire sequence tree
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...
Yaniv Loewenstein, Michal Linial
FOCS
2008
IEEE
15 years 8 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
MOBICOM
2010
ACM
15 years 1 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao