Sciweavers

451 search results - page 53 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
IJCV
2006
116views more  IJCV 2006»
13 years 8 months ago
Contextual Inference in Contour-Based Stereo Correspondence
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
Gang Li, Steven W. Zucker
STACS
1999
Springer
14 years 27 days ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
ICC
2007
IEEE
217views Communications» more  ICC 2007»
14 years 3 months ago
Decentralized Activation in a ZigBee-enabled Unattended Ground Sensor Network: A Correlated Equilibrium Game Theoretic Analysis
Abstract— We describe a decentralized learning-based activation algorithm for a ZigBee-enabled unattended ground sensor network. Sensor nodes learn to monitor their environment i...
Michael Maskery, Vikram Krishnamurthy
ICCV
2005
IEEE
14 years 2 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 9 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala