Sciweavers

4114 search results - page 553 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
16 years 6 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
15 years 6 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
201
Voted
JOC
2000
181views more  JOC 2000»
15 years 6 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
TVCG
2008
167views more  TVCG 2008»
15 years 5 months ago
Optimal Surface Parameterization Using Inverse Curvature Map
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
Yong-Liang Yang, Junho Kim, Feng Luo 0002, Shi-Min...
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
15 years 4 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...