Sciweavers

256 search results - page 30 / 52
» Separation of NP-Completeness Notions
Sort
View
GPCE
2005
Springer
15 years 5 months ago
A Generative Programming Approach to Interactive Information Retrieval: Insights and Experiences
We describe the application of generative programming to a problem in interactive information retrieval. The particular interactive information retrieval problem we study is the su...
Saverio Perugini, Naren Ramakrishnan
SPIRE
2005
Springer
15 years 5 months ago
A Model for Information Retrieval Based on Possibilistic Networks
This paper proposes a model for Information Retrieval (IR) based on possibilistic directed networks. Relations documents-terms and query-terms are modeled through possibility and n...
Asma Brini, Mohand Boughanem, Didier Dubois
UML
2005
Springer
15 years 5 months ago
Extending Profiles with Stereotypes for Composite Concepts
Abstract. This paper proposes an extension of the UML 2.0 profiling mechanism. This extension facilitates a language designer to introduce composite concepts as separate conceptual...
Dick A. C. Quartel, Remco M. Dijkman, Marten van S...
ICML
2004
IEEE
15 years 5 months ago
Redundant feature elimination for multi-class problems
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
Annalisa Appice, Michelangelo Ceci, Simon Rawles, ...
CRYPTO
2004
Springer
108views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Many cryptographic primitives begin with parameter generation, which picks a primitive from a family. Such generation can use public coins (e.g., in the discrete-logarithm-based c...
Chun-Yuan Hsiao, Leonid Reyzin