702 search results - page 109 / 141 » Identifying Graph Automorphisms Using Determining Sets |
RSA
2008
14 years 11 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
194
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
124
click to vote
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
106
click to vote
IS
2012
13 years 7 months ago
2012
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
98
Voted
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...