Sciweavers

2168 search results - page 127 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 3 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
INFOCOM
2012
IEEE
13 years 5 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
ISCAS
2006
IEEE
206views Hardware» more  ISCAS 2006»
15 years 9 months ago
JPEG2000 image coding system theory and applications
JPEG2000, the new standard for still image coding, Quantization, user defined wavelets, arbitrary wavelet provides a new framework and an integrated toolbox to better decomposition...
Athanassios N. Skodras, Touradj Ebrahimi
AI
2000
Springer
15 years 7 months ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu
ICML
2009
IEEE
15 years 10 months ago
Sparse higher order conditional random fields for improved sequence labeling
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
Xian Qian, Xiaoqian Jiang, Qi Zhang, Xuanjing Huan...