Sciweavers

708 search results - page 85 / 142
» Watermarking Relational Databases Using Optimization-Based T...
Sort
View
SIGMOD
1999
ACM
136views Database» more  SIGMOD 1999»
15 years 2 months ago
Query Rewriting for Semistructured Data
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
Yannis Papakonstantinou, Vasilis Vassalos
ICIAR
2010
Springer
15 years 1 months ago
A Geometric Data Structure Applicable to Image Mining and Retrieval
Abstract. Due to improvements in image acquisition and storage technology, terabyte-sized databases of images are nowadays common. This abundance of data leads us to two basic prob...
T. Iwaszko, Mahmoud Melkemi, Lhassane Idoumghar
ML
2006
ACM
131views Machine Learning» more  ML 2006»
14 years 10 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
CCS
2005
ACM
15 years 3 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
15 years 11 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan