Results 271 to 280 of about 1,729,857 (317)
Some of the next articles are maybe not open access.
International Journal of Computational Science and Engineering, 2011
Databases today are carefully engineered: there is an expensive and deliberate design process, after which a database schema is defined; during this design process, various possible instance examples and use cases are hypothesised and carefully analysed; finally, the schema is ready and then can be populated with data.
H. V. Jagadish +2 more
openaire +1 more source
Databases today are carefully engineered: there is an expensive and deliberate design process, after which a database schema is defined; during this design process, various possible instance examples and use cases are hypothesised and carefully analysed; finally, the schema is ready and then can be populated with data.
H. V. Jagadish +2 more
openaire +1 more source
Journal of Learning Disabilities, 1984
In November 1984, l told why l bought a floppy disk drive for my classroom PET and refused a second Apple. By fitting the PET with a disk drive (it had a cassette), I increased its speed and program versatility. Teachers do not need new computers for drill and practice, although in five years innovations in voice control and simulation may make all ...
openaire +3 more sources
In November 1984, l told why l bought a floppy disk drive for my classroom PET and refused a second Apple. By fitting the PET with a disk drive (it had a cassette), I increased its speed and program versatility. Teachers do not need new computers for drill and practice, although in five years innovations in voice control and simulation may make all ...
openaire +3 more sources
Neurocomputing, 2001
Abstract The NeuroHomology database is a knowledge-based database that contains related sets of data on brain structures, connections and homologies in different species. In this paper we propose a set of rules, embedded in the database, for evaluation of the similarity between brain structures and of the neuroanatomical connections as reflected in ...
Mihail Bota, Michael A. Arbib
openaire +1 more source
Abstract The NeuroHomology database is a knowledge-based database that contains related sets of data on brain structures, connections and homologies in different species. In this paper we propose a set of rules, embedded in the database, for evaluation of the similarity between brain structures and of the neuroanatomical connections as reflected in ...
Mihail Bota, Michael A. Arbib
openaire +1 more source
Journal of the ACM, 1983
An algebraic foundation of database schema design is presented. A new database operator, namely, disaggregation, is introduced. Beginning with “free” families, repeated applications of disaggregation and three other operators (matching function, Cartesian product, and selection) yield families of increasingly elaborate structure.
openaire +2 more sources
An algebraic foundation of database schema design is presented. A new database operator, namely, disaggregation, is introduced. Beginning with “free” families, repeated applications of disaggregation and three other operators (matching function, Cartesian product, and selection) yield families of increasingly elaborate structure.
openaire +2 more sources
Image + database ≠ image database
Proceedings of the 1st international workshop on Computer vision meets databases, 2004For decades, computer vision researchers have been trying to extract high level information from images. While the semantics of images is still unreachable from the signal in most real cases, users would like to express requests to image data bases using high-level queries.
openaire +1 more source
IEEE Transactions on Software Engineering, 1978
Databases may be compromised by asking a set of queries which return only statistical information and making inferences about a specific entry from the results of the set of queries. We present methods of constructing the set of queries to compromise a database where all the queries in the set return the maximum of a set of k elements, or all queries ...
George I. Davida +3 more
openaire +1 more source
Databases may be compromised by asking a set of queries which return only statistical information and making inferences about a specific entry from the results of the set of queries. We present methods of constructing the set of queries to compromise a database where all the queries in the set return the maximum of a set of k elements, or all queries ...
George I. Davida +3 more
openaire +1 more source
AI & Society, 2000
In the age of information overload, the primary concern for many knowledge areas becomes the organisation and retrieval of data. Artists have a unique opportunity, at this historical juncture, to play a role in the definition and design of systems of access and retrieval, and at the very least comment on the existing practices.
openaire +1 more source
In the age of information overload, the primary concern for many knowledge areas becomes the organisation and retrieval of data. Artists have a unique opportunity, at this historical juncture, to play a role in the definition and design of systems of access and retrieval, and at the very least comment on the existing practices.
openaire +1 more source
ACM SIGACT News, 2008
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as probabilities. We review the basic definitions of the probabilistic data model and present some fundamental theoretical results for query evaluation on probabilistic databases.
openaire +1 more source
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as probabilities. We review the basic definitions of the probabilistic data model and present some fundamental theoretical results for query evaluation on probabilistic databases.
openaire +1 more source
Database clustering for mining multi-databases
2002 IEEE World Congress on Computational Intelligence. 2002 IEEE International Conference on Fuzzy Systems. FUZZ-IEEE'02. Proceedings (Cat. No.02CH37291), 2003Presents an efficient and effective application-independent database cluster for mining multi-databases. Our experimental results show that the proposed approach is effective and promising.
Chengqi Zhang, Shichao Zhang 0001
openaire +1 more source
Communications of the ACM, 2014
Use the database built for your access model.
openaire +1 more source
Use the database built for your access model.
openaire +1 more source