Sciweavers

8141 search results - page 1583 / 1629
» Higher Order Generalization
Sort
View
IVC
2006
227views more  IVC 2006»
13 years 9 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu
JMLR
2008
168views more  JMLR 2008»
13 years 9 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
JCB
2006
107views more  JCB 2006»
13 years 9 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
EAAI
2007
93views more  EAAI 2007»
13 years 9 months ago
Mining Pareto-optimal rules with respect to support and confirmation or support and anti-support
: In knowledge discovery and data mining many measures of interestingness have been proposed in order to measure the relevance and utility of the discovered patterns. Among these m...
Izabela Brzezinska, Salvatore Greco, Roman Slowins...
ENDM
2007
88views more  ENDM 2007»
13 years 9 months ago
Graph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
Nathan Linial, Jirí Matousek, Or Sheffet, G...
« Prev « First page 1583 / 1629 Last » Next »