Sciweavers

145 search results - page 8 / 29
» Fast, Randomized Join-Order Selection - Why Use Transformati...
Sort
View
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
15 years 6 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein
84
Voted
ENTCS
2002
88views more  ENTCS 2002»
15 years 5 days ago
Testing Concurrent Java Programs using Randomized Scheduling
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...
Scott D. Stoller
113
Voted
JEI
2000
134views more  JEI 2000»
15 years 4 days ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent
124
Voted
TIT
2008
121views more  TIT 2008»
15 years 8 days ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
CORR
2008
Springer
170views Education» more  CORR 2008»
15 years 13 days ago
Fast Wavelet-Based Visual Classification
We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work [13]. Specifically, trading-off biological accuracy for comput...
Guoshen Yu, Jean-Jacques E. Slotine