Sciweavers

848 search results - page 119 / 170
» Randomness and the linear degrees of computability
Sort
View
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 4 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
BMCBI
2006
123views more  BMCBI 2006»
14 years 12 months ago
Permutation test for periodicity in short time series data
Background: Periodic processes, such as the circadian rhythm, are important factors modulating and coordinating transcription of genes governing key metabolic pathways. Theoretica...
Andrey A. Ptitsyn, Sanjin Zvonic, Jeffrey M. Gimbl...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 7 days ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
ICDCS
2006
IEEE
15 years 5 months ago
Fast data access over asymmetric channels using fair and secure bandwidth sharing
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg...
ICPR
2000
IEEE
15 years 3 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu