1091 search results - page 143 / 219 » Approximation Algorithms for Data Placement Problems |
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
BIRD
2008
Springer
13 years 10 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
EMNLP
2008
13 years 9 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...