posted by user: hrlee || 5834 views || tracked by 9 users: [display]

GISCUP 2015 : The 4th GIS-focused algorithm competition, GISCUP 2015, co-located with ACM SIGSPATIAL GIS 2015

FacebookTwitterLinkedInGoogle

Link: http://research.csc.ncsu.edu/stac/GISCUP2015/index.php
 
When Nov 3, 2015 - Nov 6, 2015
Where Seattle, WA, USA
Submission Deadline Aug 24, 2015
Categories    GIS   spatial   algorithm   database
 

Call For Papers

The 4th GIS-focused algorithm competition, GISCUP 2015, co-located with ACM
SIGSPATIAL GIS 2015 November 3, 2015, Seattla, WA, USA

Submission deadline: August 24, 2015


Call for Participation

Introducing the 4th GIS-focused algorithm competition, GISCUP 2015, co-located
with ACM SIGSPATIAL GIS 2015.

With the goal of encouraging innovation in a fun way, ACM SIGSPATIAL is hosting
an algorithm contest with winners to be announced at the ACM SIGSPATIAL GIS
conference in November 2015. Contest participants will submit original computer
programs to be evaluated by the contest organizers on a common dataset.

This year contest will be about finding shortest path under polygonal obstacles.
Route planner is one of the most popular web GIS services in use today. Route
planner is one of the key functionality offered by the leading web services like
Google Maps, MapQuest, and ViaMichelin. Shortest path is one of the core
functionality in any route planner. Computing shortest path over a network is a
well-studied problem in the literature and as well as widely used online
services.

Computing shortest paths in real-time has become a necessity with the advent of
online web services. It also became imperative to provide shortest paths under
various constraints. Many online services now support variety of constraints,
including avoiding tolls and boarders to selecting favorite highways.

Polygonal avoidance is an important problem in selecting shortest paths due to
many reasons. Many times, part of the network may have been closed for repairs
(static time constraint: during certain period of day/time) or due to emergency
situation (dynamic time constraint). Therefore, computing shortest paths that
obey both static and dynamic time constraints and avoid regions (polygons) of a
network is an important and challenging task. This year SIGPSPATIAL cup seek to
address this very important programming challenge.

Top three teams will be provided with cash and or other prizes. In addition to
these prizes, the top three teams will be invited to submit a four page paper
for a contest paper session to be held at the 2015 ACM SIGSPATIAL GIS
conference. These papers will be subject to review and acceptance by the contest
organizers, but it is expected that each of the top three teams will have their
paper in the conference proceedings, a ten-minute presentation in the contest
session, and a poster presentation in the conference's regular poster session.
At least one team member of each winning team must register for the ACM
SIGSPATIAL GIS conference.

More information about the contest is here:
http://research.csc.ncsu.edu/stac/GISCUP2015/


Contest Chairs:

Ranga Raju Vatsavai North Carolina State University, rrvatsav at
ncsu (dot) edu

Xin Chen Nokia Here, Illinois Institute of Technology, Northwestern University,
xin (dot) 5 (dot) chen at here (dot) com

Siva Ravada Oracle Corporation, siva (dot) ravada at oracle (dot) com


Contest Masters:

Ashwin Shashidharan North Carolina State University, ashashi3 at ncsu (dot) edu

Krishna Karthik Gadiraju North Carolina State University, kgadira at ncsu (dot)
edu

Related Resources

IPIN competition 2024   IPIN competition 2024
IJMIT 2024   International Journal of Managing Information Technology- WJCI Indexed, H index 24
GISTAM 2025   11th International Conference on Geographical Information Systems Theory, Applications and Management
IJP2P 2024   International Journal of Peer-to-Peer networks
GEOProcessing 2025   The Seventeenth International Conference on Advanced Geographic Information Systems, Applications, and Services
COMS 2025   The 16th Workshop on Computational Optimization, Modelling and Simulation (COMS 2025)
ALENEX 2025   SIAM Symposium on Algorithm Engineering and Experiments
SDSM 2024   Suicide Detection on Social Media @ IEEE BigData 2024
Open Psychology 2025   Call for Papers - Article competition for young researchers in Psychology
DMDB 2025   12th International Conference on Data Mining and Database