Sivan Toledo mostly deals with Algorithm, Parallel computing, Linear algebra, Numerical linear algebra and Multiplication. Her Algorithm research incorporates themes from Cuthill–McKee algorithm and Upper and lower bounds. Her work deals with themes such as Matrix multiplication and Arithmetic, which intersect with Upper and lower bounds.
Her studies in Linear algebra integrate themes in fields like Numerical analysis, Out-of-core algorithm, QR decomposition, Least squares and Solver. Her Numerical linear algebra study incorporates themes from Multithreading, Moore–Penrose pseudoinverse, Multigrid method, Parallelism and Key. In her work, Cache is strongly intertwined with Sparse matrix, which is a subfield of Multiplication.
Her main research concerns Algorithm, Matrix, Combinatorics, Parallel computing and Sparse matrix. Sivan Toledo focuses mostly in the field of Algorithm, narrowing it down to topics relating to LU decomposition and, in certain cases, Incomplete LU factorization. She combines subjects such as Basis, Orthonormal basis, Singular value decomposition and Applied mathematics with her study of Matrix.
Her work investigates the relationship between Combinatorics and topics such as Diagonally dominant matrix that intersect with problems in Preconditioner. Her study in Parallel computing is interdisciplinary in nature, drawing from both Minimum degree algorithm, Solver and Matrix multiplication. Her Sparse matrix research includes elements of Theoretical computer science, Factorization, Sparse approximation, Multiplication and Cholesky decomposition.
Sivan Toledo spends much of her time researching Throughput, Tracking system, Transmitter, Real-time computing and Time of arrival. Her studies deal with areas such as Foraging and Global Positioning System as well as Tracking system. Her Global Positioning System research is multidisciplinary, incorporating elements of Bandwidth and Chip.
In her work, Sivan Toledo performs multidisciplinary research in Transmitter and Signal processing. Her Tracking research is multidisciplinary, relying on both Scale, Data mining and Atlas. Her work carried out in the field of Base station brings together such families of science as Physical layer, Transmission, Communications protocol and Protocol.
Tracking system, Throughput, Global Positioning System, Ecology and Track analysis are her primary areas of study. Her Tracking system research spans across into fields like Signal processing and Transmitter. Along with Throughput, other disciplines of study including Atlas, Sampling, Tracking and Scale are integrated into her research.
Her Global Positioning System study integrates concerns from other disciplines, such as Real-time computing, Bandwidth and Chip. Her study in the field of Habitat is also linked to topics like Cognitive psychology, Spatial analysis and Orientation. She integrates several fields in her works, including Track analysis, Random search, Cognitive map, Forage and Foraging.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
VTrack: accurate, energy-aware road traffic delay estimation using mobile phones
Arvind Thiagarajan;Lenin Ravindranath;Katrina LaCurts;Samuel Madden.
international conference on embedded networked sensor systems (2009)
VTrack: accurate, energy-aware road traffic delay estimation using mobile phones
Arvind Thiagarajan;Lenin Ravindranath;Katrina LaCurts;Samuel Madden.
international conference on embedded networked sensor systems (2009)
Algorithms and data structures for flash memories
Eran Gal;Sivan Toledo.
ACM Computing Surveys (2005)
Algorithms and data structures for flash memories
Eran Gal;Sivan Toledo.
ACM Computing Surveys (2005)
Improving the memory-system performance of sparse-matrix vector multiplication
S. Toledo.
Ibm Journal of Research and Development (1997)
Improving the memory-system performance of sparse-matrix vector multiplication
S. Toledo.
Ibm Journal of Research and Development (1997)
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
Haim Avron;Sivan Toledo.
Journal of the ACM (2011)
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
Haim Avron;Sivan Toledo.
Journal of the ACM (2011)
Communication lower bounds for distributed-memory matrix multiplication
Dror Irony;Sivan Toledo;Alexander Tiskin.
Journal of Parallel and Distributed Computing (2004)
Communication lower bounds for distributed-memory matrix multiplication
Dror Irony;Sivan Toledo;Alexander Tiskin.
Journal of Parallel and Distributed Computing (2004)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Tel Aviv University
University of California, Berkeley
Hebrew University of Jerusalem
University of California, Santa Barbara
Tel Aviv University
Lawrence Berkeley National Laboratory
New York University
Tel Aviv University
Umeå University
Polytechnic University of Milan
KU Leuven
University of Girona
Royal Institute of Technology
University of Antwerp
Gdańsk University of Technology
MIT
Atlantic Oceanographic and Meteorological Laboratory
University of California, Los Angeles
University of Liverpool
World Health Organization
Leiden University Medical Center
Dartmouth College
University of Sheffield
University of Pennsylvania
University of Maryland, Baltimore