Sciweavers

304 search results - page 35 / 61
» Solving Generalized Small Inverse Problems
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
ICCV
2009
IEEE
15 years 19 days ago
Tensor completion for estimating missing values in visual data
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 2 months ago
Insight knowledge in search based software testing
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
Andrea Arcuri
ASIACRYPT
2001
Springer
14 years 5 days ago
Supersingular Curves in Cryptography
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
Steven D. Galbraith
ICNP
2000
IEEE
14 years 2 days ago
Optimal Partitioning of Multicast Receivers
Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, various multi-rate schemes, based upon the use ...
Yang Richard Yang, Min Sik Kim, Simon S. Lam