Sciweavers

2743 search results - page 266 / 549
» Minimization of an M-convex Function
Sort
View
SASO
2008
IEEE
16 years 1 months ago
Using Global Information for Load Balancing in DHTs
Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only...
Mikael Högqvist, Seif Haridi, Nico Kruber, Al...
CVPR
2007
IEEE
16 years 1 months ago
Optimized Color Sampling for Robust Matting
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...
Jue Wang, Michael F. Cohen
ICIP
2007
IEEE
16 years 29 days ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
ICRA
2007
IEEE
136views Robotics» more  ICRA 2007»
16 years 29 days ago
Inverse Kinematics for a Point-Foot Quadruped Robot with Dynamic Redundancy Resolution
— In this work we examine the control of center of mass and swing leg trajectories in LittleDog, a point-foot quadruped robot. It is not clear how to formulate a function to comp...
Alexander C. Shkolnik, Russ Tedrake
FSTTCS
2007
Springer
16 years 25 days ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...