Sciweavers

1456 search results - page 31 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
EUROCRYPT
2008
Springer
13 years 9 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith
ECIR
2011
Springer
12 years 11 months ago
Exploiting Thread Structures to Improve Smoothing of Language Models for Forum Post Retrieval
Due to many unique characteristics of forum data, forum post retrieval is different from traditional document retrieval and web search, raising interesting research questions abou...
Huizhong Duan, Chengxiang Zhai
JAIR
2006
108views more  JAIR 2006»
13 years 7 months ago
Preference-based Search using Example-Critiquing with Suggestions
We consider interactive tools that help users search for their most preferred item in a large collection of options. In particular, we examine example-critiquing, a technique for ...
Paolo Viappiani, Boi Faltings, Pearl Pu
IPM
2011
71views more  IPM 2011»
12 years 11 months ago
Improving semistatic compression via phrase-based modeling
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
ASE
1998
81views more  ASE 1998»
13 years 7 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang