Sciweavers

159 search results - page 2 / 32
» Generating Functions for Computing the Myerson Value
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 5 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
BIB
2008
74views more  BIB 2008»
13 years 5 months ago
The relative value of operon predictions
For most organisms, computational operon predictions are the only source of genome-wide operon information. Operon prediction methods described in literature are based on (a combi...
Rutger W. W. Brouwer, Oscar P. Kuipers, Sacha A. F...
ICIP
2008
IEEE
14 years 5 days ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy
CORR
2012
Springer
235views Education» more  CORR 2012»
12 years 1 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli
DCC
2006
IEEE
14 years 5 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis