Sciweavers

1552 search results - page 240 / 311
» On the Complexity of Constant Propagation
Sort
View
VVS
2000
IEEE
130views Visualization» more  VVS 2000»
15 years 10 months ago
A practical evaluation of popular volume rendering algorithms
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
Michael Meißner, Jian Huang, Dirk Bartz, Kla...
SC
2000
ACM
15 years 10 months ago
MPICH-GQ: Quality-of-Service for Message Passing Programs
Parallel programmers typically assume that all resources required for a program’s execution are dedicated to that purpose. However, in local and wide area networks, contention f...
Alain J. Roy, Ian T. Foster, William Gropp, Nichol...
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 10 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
ICLP
1999
Springer
15 years 10 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski
ILP
1998
Springer
15 years 10 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...