Sciweavers

84 search results - page 10 / 17
» A Simple Approach for HPSG Supertagging Using Dependency Inf...
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 7 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
CSFW
2005
IEEE
14 years 1 months ago
End-to-End Availability Policies and Noninterference
This paper introduces the use of static information flow analysis for the specification and enforcement of end-toend availability policies in programs. We generalize the decentr...
Lantian Zheng, Andrew C. Myers
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
KDD
2004
ACM
162views Data Mining» more  KDD 2004»
14 years 7 months ago
Discovering Links Between Lexical and Surface Features in Questions and Answers
Information retrieval systems, based on keyword match, are evolving to question answering systems that return short passages or direct answers to questions, rather than URLs point...
Soumen Chakrabarti
IBPRIA
2007
Springer
14 years 1 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...