Sciweavers

12950 search results - page 2590 / 2590
» On Optimal Timed Strategies
Sort
View
GIS
2005
ACM
14 years 5 months ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 5 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 5 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
13 years 11 months ago
Dynamic Observers for the Synthesis of Opaque Systems
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Franck Cassez, Jérémy Dubreil, Herv&...
HPCC
2011
Springer
12 years 4 months ago
Achieving Performance and Availability Guarantees with Spot Instances
Abstract—In the Infrastructure-as-a-Service (IaaS) cloud computing market, spot instances refer to virtual servers that are rented via an auction. Spot instances allow IaaS provi...
Michele Mazzucco, Marlon Dumas
« Prev « First page 2590 / 2590 Last » Next »