Sciweavers

1279 search results - page 213 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
14 years 9 months ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...
IPSN
2007
Springer
14 years 3 months ago
Energy-optimized image communication on resource-constrained sensor platforms
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
Dong-U Lee, Hyungjin Kim, Steven Tu, Mohammad H. R...
AIRS
2004
Springer
14 years 2 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
ECML
2003
Springer
14 years 2 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
ECML
2006
Springer
14 years 14 days ago
Prioritizing Point-Based POMDP Solvers
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony