Sciweavers

29908 search results - page 165 / 5982
» On the complexity of communication complexity
Sort
View
DCC
2006
IEEE
16 years 6 months ago
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
Wilfried Meidl, Arne Winterhof
ICDM
2003
IEEE
123views Data Mining» more  ICDM 2003»
15 years 11 months ago
Complex Spatial Relationships
This paper describes the need for mining complex relationships in spatial data. Complex relationships are defined as those involving two or more of: multi-feature co-location, sel...
Robert Munro, Sanjay Chawla, Pei Sun
ISTA
2007
15 years 8 months ago
Knowledge and Metadata Integration for Warehousing Complex Data
: With the ever-growing availability of so-called complex data, especially on the Web, decision-support systems such as data warehouses must store and process data that are not onl...
Jean-Christian Ralaivao, Jérôme Darmo...
DCG
2008
77views more  DCG 2008»
15 years 6 months ago
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
Eran Nevo
JCT
2006
69views more  JCT 2006»
15 years 6 months ago
The Bergman complex of a matroid and phylogenetic trees
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
Federico Ardila, Caroline J. Klivans