2095 search results - page 120 / 419 » Improved pebbling bounds |
142
Voted
JCST
2008
15 years 1 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
118
Voted
RTS
2010
14 years 11 months ago
2010
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
DCC
2005
IEEE
16 years 20 days ago
2005
IEEE
We generalize results of Homma and Kim [2001, J. Pure Appl. Algebra 162, 273?290] concerning an improvement on the Goppa bound on the minimum distance of certain Goppa codes.
107
click to vote
NIPS
2008
15 years 2 months ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
108
Voted
KRDB
2001
15 years 2 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...