Sciweavers

9359 search results - page 212 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
FOGA
2011
14 years 8 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
WWW
2007
ACM
16 years 5 months ago
A new suffix tree similarity measure for document clustering
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
Hung Chim, Xiaotie Deng
177
Voted
EDBT
2012
ACM
216views Database» more  EDBT 2012»
13 years 7 months ago
Effectively indexing the multi-dimensional uncertain objects for range searching
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
13 years 7 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind