Sciweavers

4131 search results - page 40 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
121
Voted
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 6 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 4 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
JGO
2011
122views more  JGO 2011»
14 years 9 months ago
Towards the global solution of the maximal correlation problem
The maximal correlation problem (MCP) aiming at optimizing correlation between sets of variables plays a very important role in many areas of statistical applications. Currently, a...
Lei-Hong Zhang, Li-Zhi Liao, Li-Ming Sun
ICML
2005
IEEE
16 years 2 months ago
A general regression technique for learning transductions
The problem of learning a transduction, that is a string-to-string mapping, is a common problem arising in natural language processing and computational biology. Previous methods ...
Corinna Cortes, Mehryar Mohri, Jason Weston
118
Voted
TKDE
2010
148views more  TKDE 2010»
15 years 9 days ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang