Sciweavers

11573 search results - page 275 / 2315
» Designing Relational Databases
Sort
View
HICSS
2007
IEEE
101views Biometrics» more  HICSS 2007»
16 years 29 days ago
Antecedents to Relational and Nonrelational Source Use: An Exploratory Investigation
Drawing a distinction between relational and nonrelational sources, we explore the antecedents to selecting an information source. The antecedents to use have been categorized int...
J. Christopher Zimmer, Raymond M. Henry
SEMWEB
2005
Springer
16 years 3 days ago
Representing Probabilistic Relations in RDF
Probabilistic inference will be of special importance when one needs to know how much we can say with what all we know given new observations. Bayesian Network is a graphical prob...
Yoshio Fukushige
WCC
2005
Springer
135views Cryptology» more  WCC 2005»
16 years 3 days ago
Open Problems Related to Algebraic Attacks on Stream Ciphers
Abstract. The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generator...
Anne Canteaut
CAV
1994
Springer
73views Hardware» more  CAV 1994»
15 years 10 months ago
A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
Insup Lee, Sanguthevar Rajasekaran
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 8 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál