Sciweavers

401 search results - page 46 / 81
» Random Early Marking
Sort
View
85
Voted
ECCC
2010
103views more  ECCC 2010»
15 years 16 days ago
Pseudorandom Generators for Regular Branching Programs
We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2...
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
CORR
2007
Springer
131views Education» more  CORR 2007»
15 years 13 days ago
Bayesian sequential change diagnosis
Sequential change diagnosis is the joint problem of detection and identification of a sudden and unobservable change in the distribution of a random sequence. In this problem, the...
Savas Dayanik, Christian Goulding, H. Vincent Poor
ML
2006
ACM
15 years 12 days ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
FOCM
2010
140views more  FOCM 2010»
14 years 11 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
99
Voted
BMVC
2010
14 years 10 months ago
Incremental Model Selection for Detection and Tracking of Planar Surfaces
Man-made environments are abundant with planar surfaces which have attractive properties and are a prerequisite for a variety of vision tasks. This paper presents an incremental m...
Johann Prankl, Michael Zillich, Bastian Leibe, Mar...