Sciweavers

9162 search results - page 1735 / 1833
» System and User Data Complexity
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
14 years 10 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
113views more  BMCBI 2010»
14 years 10 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
VC
2008
93views more  VC 2008»
14 years 9 months ago
Real-time editing and relighting of homogeneous translucent materials
Existing techniques for fast, high-quality rendering of translucent materials often fix BSSRDF parameters at precomputation time. We present a novel method for accurate rendering a...
Rui Wang 0004, Ewen Cheslack-Postava, Rui Wang 000...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 days ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 4 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
« Prev « First page 1735 / 1833 Last » Next »