default search action

combined dblp search
author search
venue search
publication search

ask others

K. V. S. Dileep

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2017
[c4]
- view
  - electronic edition @ aaai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/flairs/DileepHC17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/flairs/DileepHC17
K. V. S. Dileep, Swapnil Hingmire, Sutanu Chakraborti:
Complexity Guided Noise Filtering in QA Repositories. FLAIRS 2017: 186-189
2016
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iccbr/DileepC16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccbr/DileepC16
K. V. S. Dileep, Sutanu Chakraborti:
Eager to be Lazy: Towards a Complexity-guided Textual Case-Based Reasoning System. ICCBR 2016: 77-92
2014
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/iccbr/DileepC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccbr/DileepC14
K. V. S. Dileep, Sutanu Chakraborti:
Estimating Case Base Complexity Using Fractal Dimension. ICCBR 2014: 230-244
2010
[c1]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ipcv/DileepC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipcv/DileepC10
K. V. S. Dileep, Venkatachalam Chandrasekaran:
Learning Data Dependent Composite Kernels for Robust Image Retrieval - A Genetic Programming Approach. IPCV 2010: 294-299

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.