Back to Results
First PageMeta Content
Computer programming / Programming paradigms / Computing / Constraint satisfaction / Flow network / Mathematical optimization / Local consistency / Constraint programming / Operations research / Software engineering


On Safety of Pseudonym-Based Location Data in the Context of Constraint Satisfation Problems Tomoya Tanjo1 , Kazuhiro Minami1 , Ken Mano2 , and Hiroshi Maruyama1 1
Add to Reading List

Document Date: 2014-03-05 04:21:36


Open Document

File Size: 726,18 KB

Share Result on Facebook

City

Tokyo / San Francisco / New York / Pseudonym / Kanagawa / /

Company

Elsevier Science Inc. / Google / Japan 2 NTT Corporation / /

Country

United States / Japan / /

/

Event

Reorganization / /

Facility

Institute of Statistical Mathematics / City Planning Institute of Japan / Choco library / /

IndustryTerm

polynomial algorithm / polynomial-time verification algorithm / path perturbation algorithm / polynomial-time algorithm / location-aware computing environments / constraint network / constraint propagation algorithm / generated constraint network / /

Organization

Japan Society for the Promotion of Science / IFIP International Federation for Information Processing / NTT / Institute of Statistical Mathematics / Research Organization of Information and Systems / City Planning Institute of Japan / /

ProgrammingLanguage

Java / Groovy / /

ProvinceOrState

New York / /

Technology

Bioinformatics / Java / polynomial-time verification algorithm / path perturbation algorithm / polynomial-time algorithm / constraint propagation algorithm / GPS / previously developed polynomial algorithm / mobile devices / /

URL

http /

SocialTag