Sciweavers

2254 search results - page 237 / 451
» Computing the minimal covering set
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
JMLR
2012
13 years 9 months ago
Generic Methods for Optimization-Based Modeling
“Energy” models for continuous domains can be applied to many problems, but often suffer from high computational expense in training, due to the need to repeatedly minimize t...
Justin Domke
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
16 years 24 days ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
HT
1993
ACM
15 years 10 months ago
Concurrency Control in Collaborative Hypertext Systems
Traditional concurrency control techniques for database systems (transaction management based on locking protocols) have been successful in many multiuser settings, but these tech...
Uffe Kock Wiil, John J. Leggett