Sciweavers

1418 search results - page 50 / 284
» Schema polynomials and applications
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
16 years 2 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
JGO
2008
90views more  JGO 2008»
15 years 5 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
232
Voted
PODS
2009
ACM
86views Database» more  PODS 2009»
16 years 5 months ago
Reverse data exchange: coping with nulls
An inverse of a schema mapping M is intended to "undo" what M does, thus providing a way to perform "reverse" data exchange. In recent years, three different f...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
IADIS
2008
15 years 6 months ago
Arch: Data Integration Framework Based on Rdfa and Usability Aspects
Lots of work has already been published on developing applications for schema or ontology matching. Most of these approaches do not take the usability aspect into account. This pa...
Christiane Dominovic
DSN
2002
IEEE
15 years 10 months ago
32-Bit Cyclic Redundancy Codes for Internet Applications
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
Philip Koopman