Sciweavers

5372 search results - page 187 / 1075
» complexity 2007
Sort
View
ESANN
2006
13 years 9 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 8 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 2 months ago
A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah
SEKE
2007
Springer
14 years 2 months ago
EvoSpaces: 3D Visualization of Software Architecture
This paper presents the Evospaces reverse-engineering tool that represents the architecture and metrics of complex software systems in a 3D virtual world. The main goal of our pro...
Sazzadul Alam, Philippe Dugerdil
BMCBI
2005
92views more  BMCBI 2005»
13 years 8 months ago
FIGENIX: Intelligent automation of genomic annotation: expertise integration in a new software platform
Background: Two of the main objectives of the genomic and post-genomic era are to structurally and functionally annotate genomes which consists of detecting genes' position a...
Philippe Gouret, Vérane Vitiello, Nathalie ...