Sciweavers

689 search results - page 86 / 138
» Optimal Segmentation Using Tree Models
Sort
View
CVPR
2005
IEEE
16 years 4 months ago
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
15 years 8 months ago
An optimization approach to planning for mobile manipulation
— We present an optimization-based approach to grasping and path planning for mobile manipulators. We focus on pick-and-place operations, where a given object must be moved from ...
Dmitry Berenson, James Kuffner, Howie Choset
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
15 years 6 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
15 years 8 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 13 days ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks