Sciweavers

2778 search results - page 13 / 556
» Limit complexities revisited
Sort
View
TSP
2008
89views more  TSP 2008»
14 years 9 months ago
Coordinated Beamforming for the Multiuser MIMO Broadcast Channel With Limited Feedforward
Abstract-- Linear transmit beamforming and receive combining is a low complexity approach for communications in the multiuser multiple-input multiple-output (MIMO) channel. This pa...
Chan-Byoung Chae, David Mazzarese, Takao Inoue, Ro...
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
15 years 3 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
15 years 1 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
COMPLEXITY
2006
144views more  COMPLEXITY 2006»
14 years 9 months ago
BML revisited: Statistical physics, computer simulation, and probability
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
Raissa M. D'Souza
CPM
2003
Springer
68views Combinatorics» more  CPM 2003»
15 years 3 months ago
Multiple Genome Alignment: Chaining Algorithms Revisited
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch