Sciweavers

2239 search results - page 405 / 448
» Computing with abstract matrix structures
Sort
View
ECOOPW
1999
Springer
14 years 2 months ago
Providing Policy-Neutral and Transparent Access Control in Extensible Systems
Extensible systems, such as Java or the SPIN extensible operating system, allow for units of code, or extensions, to be added to a running system in almost arbitrary fashion. Exte...
Robert Grimm, Brian N. Bershad
COMPGEOM
2006
ACM
14 years 1 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
ECCV
2006
Springer
13 years 12 months ago
Spatial Intensity Correction of Fluorescent Confocal Laser Scanning Microscope Images
Abstract. This paper addresses the problem of intensity correction of fluorescent confocal laser scanning microscope (CLSM) images. CLSM images are frequently used in medical domai...
Sang-Chul Lee, Peter Bajcsy
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
MIDDLEWARE
2010
Springer
13 years 8 months ago
FaReCast: Fast, Reliable Application Layer Multicast for Flash Dissemination
Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in ...
Kyungbaek Kim, Sharad Mehrotra, Nalini Venkatasubr...