Sciweavers

29908 search results - page 22 / 5982
» On the Complexity of
Sort
View
ISTA
2007
13 years 9 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»
13 years 7 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»
13 years 7 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
CORR
2004
Springer
116views Education» more  CORR 2004»
13 years 7 months ago
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uy...

Book
393views
15 years 5 months ago
Computational Modeling and Complexity Science
"This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science"
Allen B. Downey