Sciweavers

5153 search results - page 119 / 1031
» Introduction to Randomized Algorithms
Sort
View
111
Voted
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 4 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
ECML
2006
Springer
15 years 6 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang
AAAI
1998
15 years 3 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 2 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
121
Voted
ACL
2010
15 years 16 days ago
Conditional Random Fields for Word Hyphenation
Finding allowable places in words to insert hyphens is an important practical problem. The algorithm that is used most often nowadays has remained essentially unchanged for 25 yea...
Nikolaos Trogkanis, Charles Elkan