Sciweavers

1424 search results - page 121 / 285
» The Multi-radius Cover Problem
Sort
View
JACM
2006
99views more  JACM 2006»
15 years 3 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
171
Voted
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 5 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
159
Voted
SDM
2009
SIAM
343views Data Mining» more  SDM 2009»
16 years 18 days ago
Change-Point Detection in Time-Series Data by Direct Density-Ratio Estimation.
Change-point detection is the problem of discovering time points at which properties of time-series data change. This covers a broad range of real-world problems and has been acti...
Masashi Sugiyama, Yoshinobu Kawahara
EVOW
2009
Springer
15 years 10 months ago
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
Mohamed Qasem, Adam Prügel-Bennett
ICPR
2008
IEEE
15 years 9 months ago
Detecting hubs and quasi cliques in scale-free networks
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
Sriganesh Srihari, Hoong Kee Ng, Kang Ning, Hon Wa...