Sciweavers

50 search results - page 1 / 10
» Maximum inner-product search using cone trees
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 11 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
JSC
2006
95views more  JSC 2006»
13 years 9 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
ICALP
2001
Springer
14 years 1 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
BIBE
2007
IEEE
108views Bioinformatics» more  BIBE 2007»
14 years 3 months ago
Using Parsimony to Guide Maximum Likelihood Searches
—The performance of maximum likelihood searches can be boosted by using the most parsimonious tree as a starting point for the search. The time spent in performing the parsimony ...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
BMCBI
2008
139views more  BMCBI 2008»
13 years 9 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu