Sciweavers

262 search results - page 39 / 53
» Conformal Mapping in Linear Time
Sort
View
SEMWEB
2009
Springer
15 years 7 months ago
Parallel Materialization of the Finite RDFS Closure for Hundreds of Millions of Triples
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
Jesse Weaver, James A. Hendler
112
Voted
RTCSA
2008
IEEE
15 years 7 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
135
Voted
LICS
1998
IEEE
15 years 4 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
JCO
2006
126views more  JCO 2006»
15 years 17 days ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
90
Voted
ENDM
2007
96views more  ENDM 2007»
15 years 17 days ago
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
Jacob Fox, Veselin Jungic, Rados Radoicic