Sciweavers

62 search results - page 8 / 13
» A New Approach and Faster Exact Methods for the Maximum Comm...
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 11 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
ICML
2009
IEEE
14 years 9 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
BMCBI
2006
143views more  BMCBI 2006»
13 years 8 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
ICPR
2010
IEEE
13 years 6 months ago
Color Constancy Using Standard Deviation of Color Channels
We address here the problem of color constancy and propose a new method to achieve color constancy based on the statistics of images with color cast. Images with color cast have st...
Anustup Choudhury, Gérard G. Medioni
CVPR
2008
IEEE
14 years 10 months ago
Automatic symmetry plane estimation of bilateral objects in point clouds
In this paper, the problem of estimating automatically the symmetry plane of bilateral objects (having perfect or imperfect mirror symmetry) in point clouds is reexamined. Classic...
Benoît Combès, John Waddington, Neil ...