Sciweavers

244 search results - page 6 / 49
» Efficient Approximation Algorithms for Repairing Inconsisten...
Sort
View
TKDE
2002
67views more  TKDE 2002»
13 years 8 months ago
Recovery from Malicious Transactions
Preventive measures sometimes fail to deflect malicious attacks. In this paper, we adopt an information warfare perspective, which assumes success by the attacker in achieving part...
Paul Ammann, Sushil Jajodia, Peng Liu
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 2 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 20 days ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 9 months ago
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
Loreto Bravo, Wenfei Fan, Floris Geerts, Shuai Ma
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 8 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...