Tuesday, July 29, 2014

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


Pattern Synthesis Techniques And Compact Data Representation Schemes For Efficient Nearest Neighbor Classification

1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario
    registrado en Universia

  Descargar recurso   Descargar recurso

Detalles del recurso

Pertenece a: ETD at Indian Institute of Science  

Descripción:

Autor(es): Pulabaigari, Viswanath - 

Id.: 54843790

Idioma: English (United States)  - 

Versión: 1.0

Estado: Final

Palabras claveNearest Neighbor Classification - 

Tipo de recurso: Thesis  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Requerimientos técnicos:  Browser: Any - 

Relación: [References] G19012

Fecha de contribución: 10-dic-2011

Contacto:

Localización:


Otros recursos que te pueden interesar

  1. Software for automated classification of probe-based confocal laser endomicroscopy videos of colorectal polyps. To support probe-based confocal laser endomicroscopy (pCLE) diagnosis by designing software for the ...
  2. `N-Body' Problems in Statistical Learning We present very fast algorithms for a large class of statistical problems, which we call all-point-...
  3. K-Nearest Neighbor Classification on Spatial Data Streams Using P-Trees Classification of spatial data has become important due to the fact that there are huge volumes of s...
  4. Discriminant Projections Embedding for Nearest Neighbor Classification. In this paper we introduce a new embedding technique to linearly project labeled data samples into a...
  5. Adaptive Kernel Metric Nearest Neighbor Classification Nearest neighbor classification assumes locally constant class conditional probabilities. This assum...

Otros recursos de la misma colección

  1. An Algorithmic Characterization Of Polynomial Functions Over Zpn The problem of polynomial representability of functions is central to many branches of mathematics. ...
  2. Reliability Modelling Of Whole RAID Storage Subsystems Reliability modelling of RAID storage systems with its various components such as RAID controllers, ...
  3. Design Of Truthful Allocation Mechanisms For Carbon Footprint Reduction Global warming is currently a major challenge faced by the world. Reduction of carbon emissions is ...
  4. Boxicity And Cubicity : A Study On Special Classes Of Graphs Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exi...
  5. Scaling Context-Sensitive Points-To Analysis Pointer analysis is one of the key static analyses during compilation. The efficiency of several com...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso