Sciweavers

1379 search results - page 252 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
15 years 5 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
98
Voted
DATE
2010
IEEE
140views Hardware» more  DATE 2010»
15 years 4 months ago
Variation-aware interconnect extraction using statistical moment preserving model order reduction
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
Tarek A. El-Moselhy, Luca Daniel
88
Voted
LICS
2002
IEEE
15 years 4 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
SSD
2001
Springer
120views Database» more  SSD 2001»
15 years 4 months ago
On Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 4 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv