299 search results - page 47 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
204
Voted
COMPGEOM
2011
ACM
14 years 4 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
15 years 6 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...
91
Voted
CVIU
2008
15 years 15 days 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...
120
Voted
CGF
2011
14 years 4 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...
105
click to vote
INFOCOM
2002
IEEE
15 years 5 months 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 ...