Sciweavers

1651 search results - page 95 / 331
» Measuring the Complexity of Classification Problems
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
13 years 11 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
14 years 24 days ago
Designing Complex Software Implementation Programs
The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of ...
Pieter M. A. Ribbers, Klaus-Clemens Schoo
CEC
2007
IEEE
14 years 2 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
VLDB
2001
ACM
92views Database» more  VLDB 2001»
14 years 8 days ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...