Sciweavers

4095 search results - page 219 / 819
» How to test a tree
Sort
View
WCRE
2000
IEEE
15 years 4 months ago
E/R Schema for the Datrix C/C++/Java Exchange Format
A SEF (software exchange format), such as GXL [6], TA [4] or RSF [7], is used to exchange data between tools that analyze software. Researchers at Bell Canada have specified the D...
Richard C. Holt, Ahmed E. Hassan, Bruno Laguë...
111
Voted
DMDW
2001
194views Management» more  DMDW 2001»
15 years 1 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch
JFPLC
2004
15 years 1 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
114
Voted
NIPS
2001
15 years 1 months ago
Convolution Kernels for Natural Language
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
Michael Collins, Nigel Duffy
ACS
2008
15 years 20 days ago
Subobject Transformation Systems
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
Andrea Corradini, Frank Hermann, Pawel Sobocinski