Sciweavers

1688 search results - page 78 / 338
» The Complexity of Rationalizing Matchings
Sort
View
JSC
2010
155views more  JSC 2010»
13 years 8 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
EPEW
2005
Springer
14 years 3 months ago
PiDuce: A Process Calculus with Native XML Datatypes
We develop the static and dynamic semantics of PiDuce, a process calculus with XML values, schemas, and pattern matching. PiDuce values include channel names, therefore the structu...
Allen L. Brown Jr., Cosimo Laneve, L. Gregory Mere...
VL
1994
IEEE
164views Visual Languages» more  VL 1994»
14 years 2 months ago
Similarity Patterns in Language
Dotplot is a technique for visualizing patterns of string matches in millions of lines of text and code. Patterns may be explored interactively or detected automatically. Applicat...
Jonathan Helfman
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 10 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
IWPEC
2009
Springer
14 years 4 months ago
Improved Induced Matchings in Sparse Graphs
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Wal...