Sciweavers

1096 search results - page 12 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
TC
1997
14 years 11 months ago
An Extensible Framework for Repairing Constraint Violations
In this paper we describe a new approach to repairing violations of integrity constraints in databases with null values. By adopting basic concepts from model-based diagnosis, we ...
Michael Gertz, Udo W. Lipeck
JDCTA
2010
134views more  JDCTA 2010»
14 years 4 months ago
A New Clustering Segmentation Algorithm of 3D Medical Data Field Based on Data Mining
Direct 3D volume segmentation is one of the difficult and hot research fields in 3D medical data field processing. Using the clustering and analyzing techniques of data mining, a ...
Li Xinwu
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
14 years 1 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
Richard Lindner, Chris Peikert
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
15 years 4 months ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew
CP
2006
Springer
15 years 1 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter