Sciweavers

1387 search results - page 82 / 278
» Effective Generalization of Relational Descriptions
Sort
View
WWW
2007
ACM
16 years 5 months ago
Exploration of query context for information retrieval
A number of existing information retrieval systems propose the notion of query context to combine the knowledge of query and user into retrieval to reveal the most exact descripti...
Keke Cai, Chun Chen, Jiajun Bu, Peng Huang, Zhimin...
FPL
2003
Springer
88views Hardware» more  FPL 2003»
15 years 9 months ago
How Secure Are FPGAs in Cryptographic Applications?
The use of FPGAs for cryptographic applications is highly attractive for a variety of reasons but at the same time there are many open issues related to the general security of FPG...
Thomas J. Wollinger, Christof Paar
CEAS
2006
Springer
15 years 8 months ago
An Email and Meeting Assistant Using Graph Walks
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...
Einat Minkov, William W. Cohen
CIKM
2008
Springer
15 years 6 months ago
Aggregate queries over ontologies
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Ca...
ASAP
2010
IEEE
193views Hardware» more  ASAP 2010»
15 years 6 months ago
Automatic generation of polynomial-based hardware architectures for function evaluation
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca