Sciweavers

2479 search results - page 400 / 496
» A Computational Theory of Working Memory
Sort
View
174
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
STACS
2010
Springer
16 years 1 months ago
Mathematics, Cryptology, Security
Abstract. In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diffie and H...
Jacques Stern
SIGMOD
2010
ACM
250views Database» more  SIGMOD 2010»
15 years 11 months ago
Spreadsheet as a relational database engine
Spreadsheets are among the most commonly used applications for data management and analysis. Perhaps they are even among the most widely used computer applications of all kinds. H...
Jerzy Tyszkiewicz
CVPR
2010
IEEE
15 years 8 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
JUCS
2010
152views more  JUCS 2010»
15 years 26 days ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian