Publications related to Category Attentional Search for Fast Object Detection by Mimicking Human Visual Perception

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Stronger serial dependence in the depth plane than the fronto-parallel plane between realistic objects: Evidence from virtual reality

David Pascucci

Visual estimates of stimulus features are systematically biased toward the features of previously encountered stimuli. Such serial dependencies have often been linked to how the brain maintains perceptual continuity. However, serial dependence has mostly b ...

ASSOC RESEARCH VISION OPHTHALMOLOGY INC2023

LOD-Homogenization of Multiscale Eddy Current Problem in Time Domain

Xiaotao Ren

Devices fabricated from Soft Magnetic Composites (SMCs) are gaining popularity in research and application. The multiscale characteristics require special attention. Solving the quasi-statics Maxwell’s equations on such devices consumes huge time and memor ...

2021

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Mikhail Kapralov, Jakab Tardos, Navid Nouri, Aidasadat Mousavifar

In this paper, we resolve the complexity problem of spectral graph sparcification in dynamic streams up to polylogarithmic factors. Using a linear sketch we design a streaming algorithm that uses (O) over tilde (n) space, and with high probability, recover ...

ASSOC COMPUTING MACHINERY2020

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

ePrint2018

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Volkan Cevher, Ya-Ping Hsieh, Marwa El Halabi, Cong Bang Vu, Van Quang Nguyen

In this paper, we consider composite convex minimization problems. We advocate the merit of considering Generalized Proximal gradient Methods (GPM) where the norm employed is not Euclidean. To that end, we show the tractability of the general proximity ope ...

2017

A Thrifty Universal Construction

Rachid Guerraoui, Cheng Wang

A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shar ...

2015

Scale-invariant representation of light field images for object recognition and tracking

Martin Vetterli, Alireza Ghasemi

Achieving perfect scale-invariance is usually not possible using classical color image features. This is mostly because of the fact that a traditional image is a two-dimensional projection of the real world. In contrast, light field imaging makes available ...

International Society for Optics and Photonics2014

Fast Byzantine Agreement

Rachid Guerraoui, Florian Huc

This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity and time complexit ...

2013

Category Attentional Search for Fast Object Detection by Mimicking Human Visual Perception

Graph Chatbot

Chat with Graph Search

Efficient Continual Finite-Sum Minimization

Stronger serial dependence in the depth plane than the fronto-parallel plane between realistic objects: Evidence from virtual reality

LOD-Homogenization of Multiscale Eddy Current Problem in Time Domain

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

General Proximal Gradient Method: A Case for Non-Euclidean Norms

A Thrifty Universal Construction

Scale-invariant representation of light field images for object recognition and tracking

Fast Byzantine Agreement

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Stronger serial dependence in the depth plane than the fronto-parallel plane between realistic objects: Evidence from virtual reality

LOD-Homogenization of Multiscale Eddy Current Problem in Time Domain

Scale-invariant representation of light field images for object recognition and tracking

Fast Byzantine Agreement

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Efficient Continual Finite-Sum Minimization

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

General Proximal Gradient Method: A Case for Non-Euclidean Norms

A Thrifty Universal Construction