Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

191 Publications


2004 | Published | Conference Paper | IST-REx-ID: 18332
A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “Blind source separation using the block-coordinate relative Newton method,” in 5th International Conference on Independent Component Analysis and Blind Signal Separation, Granada, Spain, 2004, vol. 3195, pp. 406–413.
View | DOI
 

2004 | Published | Conference Paper | IST-REx-ID: 18334
A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “Blind deconvolution using the relative Newton method,” in 5th International Conference on Independent Component Analysis and Blind Signal Separation, Granada, Spain, 2004, vol. 3195, pp. 554–561.
View | DOI
 

2004 | Published | Conference Paper | IST-REx-ID: 18331
A. M. Bronstein, M. M. Bronstein, A. Spira, and R. Kimmel, “Face recognition from facial surface metric,” in 8th European Conference on Computer Vision, Prageu, Czech Republic, 2004, vol. 3022, pp. 225–237.
View | DOI
 

2003 | Published | Conference Paper | IST-REx-ID: 18324
A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Expression-invariant 3D face recognition,” in 4th International Conference on Audio- and Video-Based Biometric Person Authentication, Guildford, United Kingdom, 2003, vol. 2688, pp. 62–70.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 11802
M. Henzinger, “Web information retrieval - an algorithmic perspective,” in 8th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2000, vol. 1879, pp. 1–8.
View | DOI
 

1997 | Published | Conference Paper | IST-REx-ID: 11803
M. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in 24th International Colloquium on Automata, Languages and Programming, Bologna, Italy, 1997, vol. 1256, pp. 594–604.
View | DOI
 

1996 | Published | Conference Paper | IST-REx-ID: 11804
M. Henzinger and J. A. Telle, “Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning,” in 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, 1996, vol. 1097, pp. 16–27.
View | DOI
 

1996 | Published | Conference Paper | IST-REx-ID: 11910
M. Henzinger and M. Thorup, “Improved sampling with applications to dynamic graph algorithms,” in 23rd International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.
View | DOI
 

1996 | Published | Book (Editor) | IST-REx-ID: 4612
R. Alur, T. A. Henzinger, and E. D. Sontag, Eds., Hybrid Systems III: Verification and Control, vol. 1066. Berlin ; Heidelberg: Springer, 1996.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 11805
M. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity in fully-dynamic graphs,” in 3rd Annual European Symposium on Algorithms, Corfu, Greece, 1995, vol. 979, pp. 171–184.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 11806
M. Henzinger, “Approximating minimum cuts under insertions,” in 22nd International Colloquium on Automata, Languages and Programming, Szeged, Hungary, 1995, vol. 944, pp. 280–291.
View | DOI
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed