Sciweavers

1098 search results - page 59 / 220
» Interval analysis for computer graphics
Sort
View
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 6 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
15 years 7 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang
STACS
2012
Springer
13 years 9 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
SCP
1998
163views more  SCP 1998»
15 years 1 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
BMCBI
2007
96views more  BMCBI 2007»
15 years 1 months ago
Features generated for computational splice-site prediction correspond to functional elements
Background: Accurate selection of splice sites during the splicing of precursors to messenger RNA requires both relatively well-characterized signals at the splice sites and auxil...
Rezarta Islamaj Dogan, Lise Getoor, W. John Wilbur...