Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Ahmed, Tanbir
Concordia University
Montreal, Canada
  Follow this Reviewer
Date Reviewed  
- 6 of 6 reviews

  A two-stage deanonymization attack against anonymized social networks
Peng W., Li F., Zou X., Wu J.  IEEE Transactions on Computers 63(2): 290-303, 2014. Type: Article

We live in an era of social networks where privacy control is a massive concern. Users leave digital traces, which may breach privacy even after anonymization. Social networking service providers collect user-provided data, and the users (naturall...

Nov 4 2014  
  On the probability of generating a lattice
Fontein F., Wocjan P.  Journal of Symbolic Computation 643-15, 2014. Type: Article

The discrete logarithm is an integer k that solves the equation bk=g, where b and g are elements of a group. For example, ...

Sep 22 2014  
  A people-to-people matching system using graph mining techniques
Kutty S., Nayak R., Chen L.  World Wide Web 17(3): 311-349, 2014. Type: Article

People-to-people networks play very important roles in our daily lives. This paper presents an in-depth study of such networks and develops an efficient match-making system. To this end, the authors integrate tools and techniques from online datin...

May 21 2014  
  Visiting convex regions in a polygonal map
Faigl J., Vonásek V., Peuil L.  Robotics and Autonomous Systems 61(10): 1070-1083, 2013. Type: Article

The multigoal path planning problem (MTP) “is to find a closed shortest path in a polygonal map such that all goals [, which are represented as convex polygons,] are visited.” The problem deals with motion planning, which has important...

Apr 9 2014  
  Parameterized complexity of connected even/odd subgraph problems
Fomin F., Golovach P.  Journal of Computer and System Sciences 80(1): 157-179, 2014. Type: Article

The notion of fixed parameter tractability involves relaxed polynomial-time complexity, which admits algorithms whose runtimes are exponential, but only in terms of some parameter that is expected to be small. More formally, a problem with input s...

Jan 2 2014  
  Condition: the geometry of numerical algorithms
Bürgisser P., Cucker F.,  Springer Publishing Company, Incorporated, New York, NY, 2013. 583 pp. Type: Book (978-3-642388-95-8)

Implementing numerical algorithms may require the approximation of numerical quantities, given that computers have only a finite number of bits and real numbers cannot be encoded with a finite number of bits. Growth in computational power has enab...

Nov 26 2013  
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy