نتایج جستجو برای: freeness
تعداد نتایج: 1223 فیلتر نتایج به سال:
In this paper, we study the class of free multiarrangements hyperplanes. Specifically, investigate relations between freeness over a field finite characteristic and Q.
In this paper we present distributed property-testing algorithms for graph properties in the congest model, with emphasis on testing subgraph-freeness. Testing a graph property P means distinguishing graphs G = (V,E) having property P from graphs that are ε-far from having it, meaning that ε|E| edges must be added or removed from G to obtain a graph satisfying P. We present a series of results,...
The aim of shape analysis is to discover precise abstractions of the reachable data structures in a program’s heap. This paper develops a shape analysis for reasoning about relational properties of data structures, such as balancedness of trees or lengths of lists. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is based on user-defined indexed graph gramm...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید