Sciweavers

4112 search results - page 120 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
16 years 6 months ago
Confidence-Aware Join Algorithms
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
Parag Agrawal, Jennifer Widom
CVPR
1998
IEEE
16 years 6 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
ASPDAC
2005
ACM
132views Hardware» more  ASPDAC 2005»
15 years 6 months ago
Automatic synthesis and scheduling of multirate DSP algorithms
- To date, most high-level synthesis systems do not automatically solve present design problems, such as those related to timing associated with the physical implementation of mult...
Ying Yi, Mark Milward, Sami Khawam, Ioannis Nousia...
ICIP
2009
IEEE
15 years 2 months ago
Optical flow and depth from motion for omnidirectional images using a TV-L1 variational framework on graphs
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
Luigi Bagnato, Pascal Frossard, Pierre Vandergheyn...
ECAI
2008
Springer
15 years 6 months ago
Theoretical Study of Ant-based Algorithms for Multi-Agent Patrolling
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
Arnaud Glad, Olivier Simonin, Olivier Buffet, Fran...