Result 1 to 20 of 50 total
Boosting binding sites prediction using gene’s positions. (English)
Przytycka, Teresa M. (ed.) et al., Algorithms in bioinformatics. 11th international workshop, WABI 2011, Saarbrücken, Germany, September 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23037-0/pbk). Lecture Notes in Computer Science 6833. Lecture Notes in Bioinformatics, 92-103 (2011).
1
Boosting binding sites prediction using gene’s positions (English)
WABI, 92-103 (2011).
2
On Euclidean vehicle routing with allocation. (English)
Comput. Geom. 43, No. 4, 357-376 (2010).
3
On the number of balanced words of given length and height over a two letter alphabet (English)
Discrete Mathematics & Theoretical Computer Science 12, No. 3, 41-62 (2010).
4
A quasi-polynomial time approximation scheme for minimum weight triangulation. (English)
J. ACM 56, No. 3 (2009).
5
Approximation schemes for node-weighted geometric Steiner tree problems. (English)
Algorithmica 55, No. 1, 240-267 (2009).
6
On Euclidean vehicle routing with allocation. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 10th international workshop, WADS 2007, Halifax, Canada, August 15‒17, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73948-7/pbk). Lecture Notes in Computer Science 4619, 601-612 (2007).
7
On an online spanning tree problem in randomly weighted graphs. (English)
Comb. Probab. Comput. 16, No. 1, 127-144 (2007).
8
On the Cohen‒Olivier algorithm for computing $ζ(s)$: error analysis in the real case for an arbitrary precision. (English)
Adv. Appl. Math. 38, No. 1, 54-70 (2007).
9
An oblivious watermarking for 3-D polygonal meshes using distribution of vertex norms (English)
IEEE Transactions on Signal Processing 55, No. 1, 142-155 (2007).
10
On an online spanning tree problem in randomly weighted graphs (English)
Combinatorics, Probability & Computing 16, No. 1, 127-144 (2007).
11
On Euclidean vehicle routing with allocation (English)
WADS, 601-612 (2007).
12
The polyharmonic local sine transform: a new tool for local image analysis and synthesis without edge effect. (English)
Appl. Comput. Harmon. Anal. 20, No. 1, 41-73 (2006).
13
Shape distributions and protein similarity (English)
German Conference on Bioinformatics, 1-10 (2006).
14
Wavelet analysis based blind watermarking for 3-D surface meshes (English)
IWDW, 123-137 (2006).
15
A quasi-polynomial time approximation scheme for minimum weight triangulation (English)
STOC, 316-325 (2006).
16
Approximation schemes for node-weighted geometric Steiner tree problems. (English)
Chekuri, Chandra (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 8th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2005, and 9th international workshop on randomization and computation, RANDOM 2005, Berkeley, CA, USA, August 22‒24, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28239-4/pbk). Lecture Notes in Computer Science 3624, 221-232 (2005).
17
Linear segmentation of discrete curves into blurred segments. (English)
Discrete Appl. Math. 151, No. 1-3, 122-137 (2005).
18
Approximation schemes for node-weighted geometric Steiner tree problems (English)
APPROX-RANDOM, 221-232 (2005).
19
Resource constrained scheduling on multiple machines. (English)
Inf. Process. Lett. 91, No. 4, 177-182 (2004).
20
Result 1 to 20 of 50 total
Start
Contact
Print
General Help
