Sciweavers

9572 search results - page 339 / 1915
» Cover Algorithms and Their Combination
Sort
View
CGF
1999
91views more  CGF 1999»
15 years 6 months ago
Efficient and Handy Texture Mapping on 3D Surfaces
There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the pro...
Kenji Matsushita, Toyohisa Kaneko
INFSOF
2008
85views more  INFSOF 2008»
15 years 6 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
ORDER
2007
89views more  ORDER 2007»
15 years 6 months ago
On-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
Patrick Baier, Bartlomiej Bosek, Piotr Micek
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
15 years 5 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis
AND
2010
15 years 4 months ago
Discovering users' topics of interest on twitter: a first look
Twitter, a micro-blogging service, provides users with a framework for writing brief, often-noisy postings about their lives. These posts are called "Tweets." In this pa...
Matthew Michelson, Sofus A. Macskassy