Sciweavers

117 search results - page 18 / 24
» Approximate Functional Dependencies for XML Data
Sort
View
IJBRA
2007
80views more  IJBRA 2007»
15 years 8 days ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
127
Voted
IMR
2003
Springer
15 years 5 months ago
Meshing Complexity of Single Part CAD Models
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
David R. White, Sunil Saigal, Steven J. Owen
125
Voted
APLAS
2010
ACM
15 years 17 days ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
97
Voted
CSDA
2008
108views more  CSDA 2008»
15 years 13 days ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
ICCV
2011
IEEE
14 years 11 days ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...