Result 1 to 20 from 126 total
The planar $k$-means problem is NP-hard. (English)
Theor. Comput. Sci. 442, 13-21 (2012).
1
On clustering to minimize the sum of Radii. (English)
SIAM J. Comput. 41, No. 1, 47-60 (2012).
2
Efficient subspace approximation algorithms. (English)
Discrete Comput. Geom. 47, No. 1, 44-63 (2012).
3
Efficient subspace approximation algorithms (English)
Discrete & Computational Geometry 47, No. 1, 44-63 (2012).
4
Knowledge representation and inference for grasp affordances. (English)
Crowley, James L. (ed.) et al., Computer vision systems. 8th international conference, ICVS 2011, Sophia Antipolis, France, September 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23967-0/pbk). Lecture Notes in Computer Science 6962, 173-182 (2011).
5
Combining plane estimation with shape detection for holistic scene understanding. (English)
Blanc-Talon, Jacques (ed.) et al., Advances concepts for intelligent vision systems. 13th international conference, ACIVS 2011, Ghent, Belgium, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23686-0/pbk). Lecture Notes in Computer Science 6915, 736-747 (2011).
6
On isolating points using disks. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 61-69 (2011).
7
Optimally decomposing coverings with translates of a convex polygon. (English)
Discrete Comput. Geom. 46, No. 2, 313-333 (2011).
8
Dataflow graph partitioning for optimal spatio-temporal computation on a coarse grain reconfigurable architecture. (English)
Koch, Andreas (ed.) et al., Reconfigurable computing: architectures, tools and applications. 7th international symposium, ARC 2011, Belfast, UK, March 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19474-0/pbk). Lecture Notes in Computer Science 6578, 125-132 (2011).
9
On isolating points using disks. (English)
Comput. Res. Repos. 2011, Article No. 1104.5043 (2011).
10
Max-coloring and online coloring with bandwidths on interval graphs (English)
ACM Transactions on Algorithms 7, No. 3, 35 (2011).
11
Optimally decomposing coverings with translates of a convex polygon (English)
Discrete & Computational Geometry 46, No. 2, 313-333 (2011).
12
On isolating points using disks (English)
ESA, 61-69 (2011).
13
Combining plane estimation with shape detection for holistic scene understanding (English)
ACIVS, 736-747 (2011).
14
Parametric modeling of trunk-root junctions using astroidal expansion geometry (English)
GRAPP, 94-99 (2011).
15
Efficient serial floating-point constant divider structure of the form 2P$\pm $1 (English)
PECCS, 485-490 (2011).
16
Dataflow graph partitioning for optimal spatio-temporal computation on a coarse grain reconfigurable architecture (English)
ARC, 125-132 (2011).
17
Knowledge representation and inference for grasp affordances (English)
ICVS, 173-182 (2011).
18
A method for flexible reduction over binary fields using a field multiplier (English)
SECRYPT, 50-58 (2011).
19
On metric clustering to minimize the sum of radii. (English)
Algorithmica 57, No. 3, 484-498 (2010).
20
Result 1 to 20 from 126 total
Start
Contact
Print
General Help
