Sciweavers

3897 search results - page 251 / 780
» complexity 2010
Sort
View
NA
2010
144views more  NA 2010»
15 years 4 months ago
A binary powering Schur algorithm for computing primary matrix roots
An algorithm for computing primary roots of a nonsingular matrix A is presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalu...
Federico Greco, Bruno Iannazzo
NETWORKS
2010
15 years 4 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
PVLDB
2010
189views more  PVLDB 2010»
15 years 4 months ago
Slicing Long-Running Queries
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
Nicolas Bruno, Vivek R. Narasayya, Ravishankar Ram...
RTAS
2010
IEEE
15 years 4 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson
SCN
2010
Springer
129views Communications» more  SCN 2010»
15 years 4 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh