Marius Catalin Iordan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marius Catalin Iordan has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Amos Lubin1 shared publication
- Brent Heeringa
Department of Computer Science Williams College
1 shared publication - Cesar E. Silva
Department of Mathematics, Williams College, Williamstown, MA 01267, USA
1 shared publication - Diane M. Beck
University of Illinios, Urbana-Champaign
1 shared publication - Grigoriev1 shared publication
- Li Fei-Fei
Stanford University
1 shared publication
Latest Publications
- 1 July 2016
- Published by Elsevier in NeuroImage
- Vol. 134, 170-179
Typicality sharpens category representations in object-selective cortex
- 1 July 2016
- Published by Elsevier in NeuroImage
- Vol. 134, 170-179
Typicality sharpens category representations in object-selective cortex
- Open Access
On μ-Compatible Metrics and Measurable Sensitivity
We introduce the notion of W-measurable sensitivity, which extends and strictly implies canonical measurable sensitivity, a measure- theoretic version of sensitive dependence on initial conditions. This notion also implies pairwise sensitivity with respect to a large class of metrics. We show that nonsingular ergodic and conservative dynamical systems on standard spaces must be either W-measurably sensitive, or isomorphic mod 0 to a minimal uniformly rigid isometry. In the finite measure-preserving case they are W-measurably sensitive or measurably isomorphic to an ergodic isometry on a compact metric space.
Open AccessOn μ-Compatible Metrics and Measurable Sensitivity
We introduce the notion of W-measurable sensitivity, which extends and strictly implies canonical measurable sensitivity, a measure- theoretic version of sensitive dependence on initial conditions. This notion also implies pairwise sensitivity with respect to a large class of metrics. We show that nonsingular ergodic and conservative dynamical systems on standard spaces must be either W-measurably sensitive, or isomorphic mod 0 to a minimal uniformly rigid isometry. In the finite measure-preserving case they are W-measurably sensitive or measurably isomorphic to an ergodic isometry on a compact metric space.
- Open Access
Searching in Dynamic Tree-Like Partial Orders
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the operations: insert; delete; test membership; and predecessor. The performance of our data structure is within an O(log w)-factor of optimal. Here w <= n is the width of the partial-order---a natural obstacle in searching a partial order.
Open AccessSearching in Dynamic Tree-Like Partial Orders
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the operations: insert; delete; test membership; and predecessor. The performance of our data structure is within an O(log w)-factor of optimal. Here w <= n is the width of the partial-order---a natural obstacle in searching a partial order.