Sciweavers

562 search results - page 106 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
ICC
2007
IEEE
185views Communications» more  ICC 2007»
14 years 2 months ago
Maximal Lifetime Rate and Power Allocation for Sensor Networks with Data Distortion Constraints
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
James C. F. Li, Subhrakanti Dey, Jamie S. Evans
EOR
2006
135views more  EOR 2006»
13 years 8 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
TIP
2008
287views more  TIP 2008»
13 years 8 months ago
3-D Object Recognition Using 2-D Views
We consider the problem of recognizing 3-D objects from 2-D images using geometric models and assuming different viewing angles and positions. Our goal is to recognize and localize...
Wenjing Li, George Bebis, Nikolaos G. Bourbakis
MVA
2011
336views Computer Vision» more  MVA 2011»
13 years 3 months ago
In-vehicle camera traffic sign detection and recognition
: In this paper we discuss theoretical foundations and a practical realization of a real-time traffic sign detection, tracking and recognition system operating on board of a vehicl...
Andrzej Ruta, Fatih Porikli, Shintaro Watanabe, Yo...
IJAR
2006
125views more  IJAR 2006»
13 years 8 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson