 |
 |
 |
|
|
| |
|
|
| |
| |
| |
|
|
|
| |
| |
|
|
At
Microsoft India Development
Center our teams develop
strategic products for Microsoft
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
 |
|
|
|
| |
|
|
|
| |
|
|
| |
|
 |
|
|
| B.E. |
|
I am Udayan Khurana. I am from Delhi and have just completed my B.E.
from Thapar Institute of Engineering and Technology, Patiala. I won
the Gold Medal for the ‘Best Overall Student of the Batch’
awarded by my institute along with TCS. I did my schooling from Bal Bharati Public School, Pitampura, New Delhi. |
|
|
|
|
My area
of interests include Information Retrieval Systems, Prime Numbers
and other number sequences, Machine Learning and Cryptography.
In the past, I have worked on Text Based Compression, Magic
Squares, Data Masking algorithms and Approximate Prime Number
Sequences. I was awarded Innovator of the Year 2004
by National Geographic Channel, IIT-Delhi, and Forum for
Innovation and Technology Transfer. I have participated and won few
national level programming contests as well. My publications
include, one at 3rd ICAPR ’05 (published in LNCS, Springer
Verlag), two at NCBC ‘05, one on an e-journal (Arxiv).
One of my papers at NCBC won the Best Research Paper Award at
that conference. I have acted as the G.Secy. of the Computing
Society of the institute organizing many technical events, including
being the Student Coordinator once and the Chief Planner once
of the Institute techfest.
My other interests include Journalism, Debating, Dramatics,
Poetry and Orkutting. I have been a keen debater, winning national
level debates and serving as the Convener of the Debating Society.
I served in the Editorial board of my college magazine too.
I like dramatics as a hobby and have won prizes at Miming and
Street Plays. I have read a lot of English and Hindi poetry
and done some studies on romanticism in English poetry too.
Apart from that, I like Orkutting (addicted to it) and chatting.
My favorite website is Wikipedia, favorite novel is “To
Kill a Mocking Bird”. I like watching Bollywood and Hollywood
movies and listening to Hindi and Urdu (Sufi) songs. My favorite
movie are “Andaaz Apna Apna” and “As good
as it gets”.
In future, I plan to go for a PhD in one of the disciplines
in Computer Science after a couple of years of work. At some
stage of my career, I plan to enter Indian politics and work
for the people of my country.
SEARCHING GEOGRAPHICALLY-TAGGED INFORMATION
Problem Statement
Searching for information that is tagged with geographic
location is both useful and technically challenging. For
example, finding information about a particular location given
just from a few, possibly incorrectly spelled landmarks would be
useful for searching for a particular location.
Approach
Our approach is based upon a combination of statistical machine
learning, full text search techniques and geo-spatial
algorithms. Statistical machine learning techniques are
advantageous because they are able to learn from data with
minimal human involvement. This allows the system to be applied
to different domains relatively rapidly. Full text search
techniques provide valuable mechanisms for ranking, approximate
matching, and for dealing with very large data sets. Geo-spatial
algorithms are all about efficiently indexing spatially oriented
data. By combining these three approaches we hope to break new
ground in the efficacy of the system. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
| |
| |
|
|
| |
| |
| Here
are some of the questions that the code4bill contestants
answered. How about trying your hand at them? |
| • |
Multiply
14332 represented in base -7 with 16430 represented
in base -8 and represent the output in base -9. |
| • |
An array
contains 9 occurrences of 0s, 8 occurrences of 1s and
7 occurrences of 2s in any order. The array is to be
sorted using only swap operations. What is the minimum
number of swaps needed in the worst case to sort the
array? |
| • |
You are given an infinite number of cookie boxes containing either 6, 9 or 400 cookies. You are allowed to use these boxes in any combination so desired. What is the maximum number of cookies that you cannot give out using the above boxes? |
|
|
|
|
|
|
|
| |
|
|
| |
| |
|
|
| |
|
|
|
|
|
