Result 1 to 20 of 129 total
An efficient and effective tool for image segmentation, total variations and regularization. (English)
Bruckstein, Alfred M. (ed.) et al., Scale space and variational methods in computer vision. Third international conference, SSVM 2011, Ein-Gedi, Israel, May 29‒June 2, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24784-2/pbk). Lecture Notes in Computer Science 6667, 338-349 (2012).
1
Nuclear threat detection with mobile distributed sensor networks. (English)
Ann. Oper. Res. 187, 45-63 (2011).
2
Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm. (English)
Comput. Res. Repos. 2011, Article No. 1105.1569 (2011).
3
Benchmark problems for totally unimodular set system auction. (English)
Comput. Res. Repos. 2011, Article No. 1102.3499 (2011).
4
Complexity of some inverse shortest path lengths problems. (English)
Networks 56, No. 1, 20-29 (2010).
5
How to allocate review tasks for robust ranking. (English)
Acta Inf. 47, No. 5-6, 325-345 (2010).
6
Covering the edges of bipartite graphs using $K_{2,2}$ graphs. (English)
Theor. Comput. Sci. 411, No. 1, 1-9 (2010).
7
Polynomial time algorithms for ratio regions and a variant of normalized cut (English)
IEEE Trans. Pattern Anal. Mach. Intell. 32, No. 5, 889-898 (2010).
8
A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. (English)
Oper. Res. 57, No. 2, 358-376 (2009).
9
The multi-integer set cover and the facility terminal cover problem. (English)
Networks 53, No. 1, 63-66 (2009).
10
Dynamic evolution of economically preferred facilities. (English)
Eur. J. Oper. Res. 193, No. 3, 649-659 (2009).
11
A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem (English)
Operations Research 57, No. 2, 358-376 (2009).
12
An efficient algorithm for co-segmentation (English)
ICCV, 269-276 (2009).
13
An efficient and effective image segmentation interactive tool (English)
BIOSIGNALS, 459-461 (2009).
14
The pseudoflow algorithm: A new algorithm for the maximum-flow problem. (English)
Oper. Res. 56, No. 4, 992-1009 (2008).
15
Solving linear cost dynamic lot-sizing problems in $O(n \log n)$ time. (English)
Oper. Res. 56, No. 1, 255-261 (2008).
16
Country credit-risk rating aggregation via the separation-deviation model. (English)
Optim. Methods Softw. 23, No. 5, 741-762 (2008).
17
Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions. (English)
Comput. Res. Repos. 2008, Article No. 0803.0146 (2008).
18
The inequality-satisfiability problem. (English)
Oper. Res. Lett. 36, No. 2, 229-233 (2008).
19
Covering the edges of bipartite graphs using $K _{2,2}$ graphs. (English)
Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77917-9/pbk). Lecture Notes in Computer Science 4927, 116-127 (2008).
20
Result 1 to 20 of 129 total
Start
Contact
Print
General Help
