Sciweavers

1096 search results - page 47 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
15 years 11 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
15 years 10 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
TCOM
2008
82views more  TCOM 2008»
14 years 9 months ago
Detecting the number of signals in wireless DS-CDMA networks
In this paper, a new information theoretic algorithm is proposed for signal enumeration in DS-CDMA networks. The approach is based on the predictive description length (PDL) of the...
Shahrokh Valaee, Shahram Shahbazpanahi
AAAI
2007
15 years 4 days ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
TASE
2008
IEEE
14 years 9 months ago
An Optimization-Based Approach for Design Project Scheduling
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
Ming Ni, Peter B. Luh, Bryan Moser