Sciweavers

7123 search results - page 233 / 1425
» The Ordered Set of Rough Sets
Sort
View
DAC
1995
ACM
15 years 10 months ago
Delayed Frontal Solution for Finite-Element Based Resistance Extraction
To save memory, layout-to-circuit extractors that use the Finite-Element Method for resistance extraction usually solve the corresponding set of equations with a frontal solution ...
N. P. van der Meijs, Arjan J. van Genderen
ORDER
2006
154views more  ORDER 2006»
15 years 6 months ago
A Bipartite Analogue of Dilworth's Theorem
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
Jacob Fox
DM
2002
92views more  DM 2002»
15 years 6 months ago
A local-global principle for vertex-isoperimetric problems
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
Sergei L. Bezrukov, Oriol Serra
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 8 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
CSR
2007
Springer
16 years 23 days ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka