1566 search results - page 153 / 314 » On a Cone Covering Problem |
160
Voted
INFSOF
2008
15 years 4 months ago
2008
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...
132
Voted
WG
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
141
Voted
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
Gathering a large collection of images has been made quite easy by social and image sharing websites, e.g. flickr.com. However, using such collections faces the problem that they ...
158
click to vote
CGF
2010
14 years 11 months ago
2010
This state of the art report covers reconstruction methods for transparent and specular objects or phenomena. While the 3D acquisition of opaque surfaces with lambertian reflectan...
147
Voted
ACL
2012
13 years 7 months ago
2012
The problem addressed in this paper is to segment a given multilingual document into segments for each language and then identify the language of each segment. The problem was mot...