Sciweavers

1722 search results - page 191 / 345
» Variables in Concept Graphs
Sort
View
JSC
2007
84views more  JSC 2007»
15 years 3 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
15 years 3 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
INFOCOM
2005
IEEE
15 years 9 months ago
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
124
Voted
STACS
2010
Springer
15 years 10 months ago
Evasiveness and the Distribution of Prime Numbers
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
László Babai, Anandam Banerjee, Ragh...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
15 years 10 months ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...