◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Anastasios Zouzias

15 papers hereh-index 161.5k citations34 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author3
  • middle author2
  • last author7

Across the 14 of 15 papers where every author was matched, so the position is known.

fields
  • cs.DS4
  • cs.CC2
  • cs.LG2
  • math.NA2
  • cs.AI1
  • cs.AR1
same name
  • Anastasios Zouzias — 6 papers, h 2
  • Anastasios Zouzias — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102022
most citedRandomized Extended Kaczmarz for Solving Least-Squares

274 citations · 422 across the 12 of their papers we have counts for

collaborators
Showing cs.DSShow all

4 papers · 1 filter

cs.DS2015

A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix

Christos Boutsidis, Petros Drineas, Prabhanjan Kambadur +2

We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the tr…

cs.DS2011★ 30 cited

Randomized Dimensionality Reduction for k-means Clustering

Christos Boutsidis, Anastasios Zouzias, Michael W. Mahoney +1

We study the topic of dimensionality reduction for k-means clustering. Dimensionality reduction encompasses the union of two approaches: \emph{feature selection} and \emph{featur…

cs.DS2011★ 20 cited

A Matrix Hyperbolic Cosine Algorithm and Applications

Anastasios Zouzias

In this paper, we generalize Spencer's hyperbolic cosine algorithm to the matrix-valued setting. We apply the proposed algorithm to several problems by analyzing its computational…

cs.DS2010

Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication

Avner Magen, Anastasios Zouzias

In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices an…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.