Sciweavers

154 search results - page 7 / 31
» Using Galois Ideals for Computing Relative Resolvents
Sort
View
EUROCRYPT
2004
Springer
14 years 23 days ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
ACL
2011
12 years 11 months ago
Which Noun Phrases Denote Which Concepts?
Resolving polysemy and synonymy is required for high-quality information extraction. We present ConceptResolver, a component for the Never-Ending Language Learner (NELL) (Carlson ...
Jayant Krishnamurthy, Tom Mitchell
IDEAL
2005
Springer
14 years 27 days ago
Identification of Anomalous SNMP Situations Using a Cooperative Connectionist Exploratory Projection Pursuit Model
Abstract. The work presented in this paper shows the capability of a connectionist model, based on a statistical technique called Exploratory Projection Pursuit (EPP), to identify ...
Álvaro Herrero, Emilio Corchado, José...
IJCSA
2008
100views more  IJCSA 2008»
13 years 7 months ago
A Smart Architecture for Low-Level Image Computing
This paper presents a comparison relating two different vision system architectures. The first one involves a smart sensor including analog processors allowing on-chip image proce...
A. Elouardi, Samir Bouaziz, Antoine Dupret, Lionel...
WSPI
2004
13 years 8 months ago
Knowledge Relativity
Abstract. I introduce the notion of knowledge relativity as a proposed conceptual link between different scientific disciplines. Examples from Informatics and Philosophy, particula...
Oliver Hoffmann