Sciweavers

8067 search results - page 1588 / 1614
» A Model Proposal of the Interoperability Problem
Sort
View
VLDB
1998
ACM
120views Database» more  VLDB 1998»
14 years 1 months ago
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
Rajeev Rastogi, Kyuseok Shim
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 1 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
ASPLOS
1992
ACM
14 years 1 months ago
Parity Declustering for Continuous Operation in Redundant Disk Arrays
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
Mark Holland, Garth A. Gibson
CICLING
2010
Springer
14 years 1 months ago
Word Length n-Grams for Text Re-use Detection
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...
Alberto Barrón-Cedeño, Chiara Basile...
CSL
2009
Springer
14 years 27 days ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
« Prev « First page 1588 / 1614 Last » Next »