299 search results - page 47 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
CVIU
2008
13 years 7 months ago
2008
We address the 3D volume reconstruction problem from depth adjacent sub-volumes acquired by a confocal laser scanning microscope (CLSM). Our goal is to align the sub-volumes by es...
CGF
2011
12 years 11 months ago
2011
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
INFOCOM
2002
IEEE
14 years 17 days ago
2002
IEEE
— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...