2631 search results - page 262 / 527 » A Practical Method for the Sparse Resultant |
206
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we present a new method to enhance depth images captured by a time-of-flight (TOF) depth sensor spatially and temporally. In practice, depth images obtained from TO...
170
click to vote
ALENEX
2007
15 years 8 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
203
click to vote
VIIP
2001
15 years 8 months ago
2001
In this paper, we present an easy, efficient and practical algorithm, which extracts the feature silhouette from a photograph for virtual human modeling. Our segmentation algorith...
175
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
208
click to vote
PUK
2000
15 years 8 months ago
2000
Abstract. In the stream of research that aims to speed up practical planners, we propose a new approach to task planning based on Probabilistic Roadmap Methods (PRM). Our contribut...