Sciweavers

311 search results - page 21 / 63
» Approximate XML joins
Sort
View
ICEIS
2009
IEEE
15 years 6 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
AMR
2005
Springer
137views Multimedia» more  AMR 2005»
15 years 5 months ago
Information Retrieval of Sequential Data in Heterogeneous XML Databases
The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing...
Eugen Popovici, Pierre-Francois Marteau, Gildas M&...
JAIR
2010
130views more  JAIR 2010»
14 years 10 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
15 years 6 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
94
Voted
KBSE
2007
IEEE
15 years 6 months ago
Finding errors in components that exchange xml data
Two or more components (e.g., objects, modules, or programs) interoperate when they exchange data, such as XML data. Using Application Programming Interface (API) calls exported b...
Mark Grechanik