680 search results - page 66 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...
PEWASUN
2006
ACM
14 years 1 months ago
2006
ACM
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...