Result 1 to 20 of 83 total
Descent methods for nonnegative matrix factorization. (English)
Van Dooren, Paul (ed.) et al., Numerical linear algebra in signals, systems and control. Selected papers based on the presentations at the international workshop, Kharagpur, India, January 9‒11, 2007. In honor of Prof. Biswa Nath Datta. New York, NY: Springer (ISBN 978-94-007-0601-9/hbk; 978-94-007-0602-6/ebook). Lecture Notes in Electrical Engineering 80, 251-293 (2011).
1
Multilevel local optimization of modularity. (English)
Bichot, Charles-Edmond (ed.) et al., Graph partitioning. Hoboken, NJ: John Wiley \& Sons; London: ISTE (ISBN 978-1-84821-233-6/hbk). 315-345 (2011).
2
Fast computation of minimal elementary decompositions of metabolic flux vectors. (English)
Automatica 47, No. 6, 1255-1259 (2011).
3
Observable graphs. (English)
Discrete Appl. Math. 159, No. 10, 981-989 (2011).
4
An upper bound on community size in scalable community detection. (English)
Comput. Res. Repos. 2011, Article No. 1103.5569 (2011).
5
The interplay between telecommunications and face-to-face interactions - an initial study using mobile phone data. (English)
Comput. Res. Repos. 2011, Article No. 1101.4505 (2011).
6
The set of realizations of a max-plus linear sequence is semi-polyhedral. (English)
J. Comput. Syst. Sci. 77, No. 4, 820-833 (2011).
7
Fast computation of minimal elementary decompositions of metabolic flux vectors (English)
Automatica 47, No. 6, 1255-1259 (2011).
8
Extremal matrix products and the finiteness property. (English)
Berthé, Valérie (ed.) et al., Combinatorics, automata, and number theory. Cambridge: Cambridge University Press (ISBN 978-0-521-51597-9/hbk). Encyclopedia of Mathematics and its Applications 135, 530-593 (2010).
9
Joint spectral characteristics of matrices: a conic programming approach. (English)
SIAM J. Matrix Anal. Appl. 31, No. 4, 2146-2162 (2010).
10
The continuous Skolem-Pisot problem. (English)
Theor. Comput. Sci. 411, No. 40-42, 3625-3634 (2010).
11
PageRank optimization in polynomial time by stochastic shortest path reformulation. (English)
Hutter, Marcus (ed.) et al., Algorithmic learning theory. 21st international conference, ALT 2010, Canberra, Australia, October 6‒8, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16107-0/pbk). Lecture Notes in Computer Science 6331. Lecture Notes in Artificial Intelligence, 89-103 (2010).
12
Polynomial-time computation of the joint spectral radius for some sets of nonnegative matrices. (English)
SIAM J. Matrix Anal. Appl. 31(2009), No. 3, 865-876 (2010).
13
Continuous-time average-preserving opinion dynamics with opinion-dependent communications (English)
SIAM J. Control and Optimization 48, No. 8, 5214-5240 (2010).
14
Joint spectral characteristics of matrices: A conic programming approach (English)
SIAM J. Matrix Analysis Applications 31, No. 4, 2146-2162 (2010).
15
Explicit solutions for root optimization of a polynomial family (English)
CDC, 485-488 (2010).
16
Opinion dynamics for agents with opinion-dependent connections (English)
CDC, 6626-6632 (2010).
17
Pagerank optimization in polynomial time by stochastic shortest path reformulation (English)
ALT, 89-103 (2010).
18
Pagerank optimization by edge selection. (English)
Comput. Res. Repos. 2009, Article No. 0911.2280 (2009).
19
Overlap-free words and spectra of matrices. (English)
Theor. Comput. Sci. 410, No. 38-40, 3670-3684 (2009).
20
Result 1 to 20 of 83 total
Start
Contact
Print
General Help
