Sciweavers

19866 search results - page 401 / 3974
» Computing all factorizations in ***
Sort
View
JUCS
2002
79views more  JUCS 2002»
15 years 6 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka
RECOMB
2006
Springer
16 years 7 months ago
Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes
Abstract. Transcriptional interactions in a cell are modulated by a variety of mechanisms that prevent their representation as pure pairwise interactions between a transcription fa...
Kai Wang, Ilya Nemenman, Nilanjana Banerjee, Adam ...
ECCV
2000
Springer
16 years 8 months ago
Euclidean Group Invariant Computation of Stochastic Completion Fields Using Shiftable-Twistable Functions
We describe a method for computing the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane, that is, a m...
John W. Zweck, Lance R. Williams
EDBT
2008
ACM
147views Database» more  EDBT 2008»
16 years 7 months ago
BITPEER: continuous subspace skyline computation with distributed bitmap indexes
In this paper, we propose a bitmap approach for efficient subspace skyline computation in a distributed setting. Our approach computes extended skylines which have been shown to i...
Katerina Fotiadou, Evaggelia Pitoura
CCGRID
2002
IEEE
15 years 12 months ago
Towards Trust-Aware Resource Management in Grid Computing Systems
Resource management is a central part of a Grid computing system. In a large-scale wide-area system such as the Grid, security is a prime concern. One approach is to be conservati...
Farag Azzedin, Muthucumaru Maheswaran