2746 search results - page 429 / 550 » Bisubmodular Function Minimization |
159
click to vote
Publication
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
135
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
152
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
146
click to vote
EUROSYS
2006
ACM
16 years 24 days ago
2006
ACM
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
143
click to vote
ICCAD
2003
IEEE
16 years 18 days ago
2003
IEEE
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...