1999 search results - page 11 / 400 » Finding Reductions Automatically |
MOR
2008
14 years 9 months ago
2008
We consider the problem of finding a low
3DPVT
2004
IEEE
15 years 1 months ago
2004
IEEE
Modern automatic digitizers can sample huge amounts of 3D data points on the object surface in a short time. Point based graphics is becoming a popular framework to reduce the car...
NLDB
2005
Springer
15 years 3 months ago
2005
Springer
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
ECCC
2006
14 years 9 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...