Sciweavers

1538 search results - page 40 / 308
» Relative Randomness and Cardinality
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 9 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
ALGORITHMICA
2007
93views more  ALGORITHMICA 2007»
14 years 9 months ago
Random 2-SAT with Prescribed Literal Degrees
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
COLING
2010
14 years 4 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
15 years 10 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu
APJOR
2010
118views more  APJOR 2010»
14 years 8 months ago
Alternative Randomization for Valuing American Options
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
Toshikazu Kimura