Sciweavers

373 search results - page 69 / 75
» Identifying graphs from noisy and incomplete data
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
BMCBI
2010
172views more  BMCBI 2010»
13 years 7 months ago
Inferring gene regression networks with model trees
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
Isabel A. Nepomuceno-Chamorro, Jesús S. Agu...
ECCV
2006
Springer
14 years 9 months ago
Carved Visual Hulls for Image-Based Modeling
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
Yasutaka Furukawa, Jean Ponce
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
14 years 8 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
LCTRTS
2005
Springer
14 years 1 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...