Sciweavers

4315 search results - page 154 / 863
» Sorting in linear time
Sort
View
ICML
2007
IEEE
14 years 10 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
13 years 10 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
TSP
2008
180views more  TSP 2008»
13 years 9 months ago
Algebraic Signal Processing Theory: Foundation and 1-D Time
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear...
Markus Püschel, José M. F. Moura
MP
2007
145views more  MP 2007»
13 years 8 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
ISSTA
2009
ACM
14 years 3 months ago
Time-aware test-case prioritization using integer linear programming
Techniques for test-case prioritization re-order test cases to increase their rate of fault detection. When there is a fixed time budget that does not allow the execution of all ...
Lu Zhang, Shan-Shan Hou, Chao Guo, Tao Xie, Hong M...