History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 68 total

On disjoint common bases in two matroids. (English)
SIAM J. Discrete Math. 25, No. 4, 1792-1803 (2011).
1
On the complexity of reconfiguration problems. (English)
Theor. Comput. Sci. 412, No. 12-14, 1054-1065 (2011).
2
Learning submodular functions (English)
STOC, 793-802 (2011).
3
A general framework for graph sparsification (English)
STOC, 71-80 (2011).
4
Query lower bounds for matroid intersection. (English)
RIMS Kôkyûroku Bessatsu B23, 81-105 (2010).
5
Graph sparsification by edge-connectivity and random spanning trees. (English)
Comput. Res. Repos. 2010, Article No. 1005.0265 (2010).
6
Use of imperfectly segmented nuclei in the classification of histopathology images of breast cancer (English)
ICASSP, 666-669 (2010).
7
Ship detection in satellite imagery using rank-order grayscale hit-or-miss transforms (English)
Visual Information Processing, 770102 (2010).
8
A randomized rounding algorithm for the asymmetric traveling salesman problem. (English)
Comput. Res. Repos. 2009, Article No. 0909.0941 (2009).
9
Algebraic algorithms for matching and matroid problems. (English)
SIAM J. Comput. 39, No. 2, 679-702 (2009).
10
Approximating submodular functions everywhere (English)
SODA, 535-544 (2009).
11
A change detection approach to moving object detection in low fame-rate video (English)
Visual Information Processing, 73410 (2009).
12
Detection of facilities in satellite imagery using semi-supervized image classification and auxiliary contextual observables (English)
Visual Information Processing, 73410 (2009).
13
Matroid intersection, pointer chasing, and Young’s seminormal representation of $S_n$. (English)
Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20‒22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 542-549 (2008).
14
On the complexity of reconfiguration problems. (English)
Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15‒17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 28-39 (2008).
15
Sketching and streaming entropy via approximation theory. (English)
Comput. Res. Repos. 2008, Article No. 0804.4138 (2008).
16
Matroid intersection, pointer chasing, and Young’s seminormal representation of ${\it s_{n}}$ (English)
SODA, 542-549 (2008).
17
Speedup of fuzzy logic through stream processing on graphics processing units (English)
IEEE Congress on Evolutionary Computation, 3809-3815 (2008).
18
Sketching and streaming entropy via approximation theory (English)
FOCS, 489-498 (2008).
19
On the complexity of reconfiguration problems (English)
ISAAC, 28-39 (2008).
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 68 total