Sciweavers

28888 search results - page 150 / 5778
» Computability and complexity in analysis
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 8 months ago
Infinity-Norm Sphere-Decoding
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
Dominik Seethaler, Helmut Bölcskei
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
CORR
2006
Springer
156views Education» more  CORR 2006»
13 years 8 months ago
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
Ying Hung Gan, Cong Ling, Wai Ho Mow
CCCG
2008
13 years 9 months ago
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
Jérémy Barbay, Eric Y. Chen
SCHEDULING
2010
137views more  SCHEDULING 2010»
13 years 6 months ago
Criticality analysis of activity networks under interval uncertainty
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
Jérôme Fortin, Pawel Zielinski, Didie...