Sciweavers

87 search results - page 3 / 18
» Combinatorial Complexity of Convex Sequences
Sort
View
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 1 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Tarcisio F. Maciel, Anja Klein
TCSV
2010
13 years 2 months ago
Action Detection in Cluttered Video With Successive Convex Matching
We propose a novel successive convex matching method for human action detection in cluttered video. Human actions are represented as sequences of poses, and specific actions are de...
Hao Jiang, Mark S. Drew, Ze-Nian Li
ALMOB
2006
138views more  ALMOB 2006»
13 years 7 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
WABI
2005
Springer
108views Bioinformatics» more  WABI 2005»
14 years 28 days ago
On the Complexity of Several Haplotyping Problems
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore