Sciweavers

131 search results - page 25 / 27
» Bellman goes relational
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 7 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
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
DSS
2007
226views more  DSS 2007»
13 years 7 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri
SYNTHESE
2008
131views more  SYNTHESE 2008»
13 years 7 months ago
A new formulation of the Principle of Indifference
This article goes to the foundations of Statistical Inference through a review of Carnap's logic theory of induction. From this point of view, it brings another solution to t...
Rodolfo de Cristofaro
PAMI
2008
203views more  PAMI 2008»
13 years 7 months ago
Free-Form Object Reconstruction from Silhouettes, Occluding Edges and Texture Edges: A Unified and Robust Operator Based on Dual
In this paper, the duality in differential form is developed between a 3D primal surface and its dual manifold formed by the surface's tangent planes, i.e., each tangent plan...
Shubao Liu, Kongbin Kang, Jean-Philippe Tarel, Dav...