Sciweavers

562 search results - page 61 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
DEBU
2010
104views more  DEBU 2010»
14 years 9 months ago
Query Results Ready, Now What?
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
Ziyang Liu, Yi Chen
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 3 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
CAISE
2005
Springer
15 years 3 months ago
BInXS: A Process for Integration of XML Schemata
This paper presents a detailed integration process for XML schemata called BInXS. BInXS adopts a global-as-view integration approach that builds a global schema from a set of heter...
Ronaldo dos Santos Mello, Carlos A. Heuser
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 1 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
CBMS
2006
IEEE
15 years 3 months ago
A Framework for Web-Based Interactive Applications of High-Resolution 3D Medical Image Data
With the advances in medical imaging devices, large volumes of high-resolution 3D medical image data have been produced. These high-resolution 3D data are very large in size, and ...
Danzhou Liu, Kien A. Hua, Kiminobu Sugaya