Sciweavers

2095 search results - page 84 / 419
» Improved pebbling bounds
Sort
View
TSP
2010
13 years 5 months ago
Improved interference cancellation scheme for two-user detection of alamouti code
In this paper, we propose an improved interference cancellation method for two-user multiple access based MIMO communication system. It is shown in the paper, that by using the pr...
Manav R. Bhatnagar, Are Hjørungnes
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
14 years 5 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough
WAIM
2007
Springer
14 years 5 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 5 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
CP
2001
Springer
14 years 3 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...