{"id":15347610,"url":"https://github.com/asolimando/hips","last_synced_at":"2025-10-25T23:36:15.164Z","repository":{"id":113900417,"uuid":"107906581","full_name":"asolimando/hips","owner":"asolimando","description":"Given a weighted set of 2D points, it computes the Heaviest Increasing Point Subset","archived":false,"fork":false,"pushed_at":"2022-05-26T09:25:26.000Z","size":24,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-16T02:29:27.700Z","etag":null,"topics":["2d-points","combinatorics","heaviest-increasing-point-subset","monotonically-increasing-function","sequences"],"latest_commit_sha":null,"homepage":null,"language":"Scala","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/asolimando.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-10-22T22:06:03.000Z","updated_at":"2017-11-25T16:01:33.000Z","dependencies_parsed_at":null,"dependency_job_id":"60a66dbc-2436-4cb2-a32e-5cbbe0e46cc6","html_url":"https://github.com/asolimando/hips","commit_stats":{"total_commits":29,"total_committers":3,"mean_commits":9.666666666666666,"dds":"0.48275862068965514","last_synced_commit":"467bfe5c83c7455cd0e7a200952a31324b798ede"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asolimando%2Fhips","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asolimando%2Fhips/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asolimando%2Fhips/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/asolimando%2Fhips/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/asolimando","download_url":"https://codeload.github.com/asolimando/hips/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242039686,"owners_count":20061925,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["2d-points","combinatorics","heaviest-increasing-point-subset","monotonically-increasing-function","sequences"],"created_at":"2024-10-01T11:36:36.258Z","updated_at":"2025-10-25T23:36:10.145Z","avatar_url":"https://github.com/asolimando.png","language":"Scala","readme":"# hips\nGiven a weighted set of 2D points, it computes the Heaviest Increasing Point Subset\n\nThe original code, re-implemented in Scala, has been written in the context of the research work available here: http://www.vldb.org/pvldb/vol6/p1630-solimando.pdf\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fasolimando%2Fhips","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fasolimando%2Fhips","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fasolimando%2Fhips/lists"}