Sciweavers

306 search results - page 59 / 62
» Underspecified computation of normal forms
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
ICASSP
2007
IEEE
14 years 1 months ago
Protein Fold Recognition using Residue-Based Alignments of Sequence and Secondary Structure
Protein structure prediction aims to determine the three-dimensional structure of proteins form their amino acid sequences. When a protein does not have similarity (homology) to a...
Zafer Aydin, Hakan Erdogan, Yucel Altunbasak
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
SSD
2005
Springer
145views Database» more  SSD 2005»
14 years 29 days ago
High Performance Multimodal Networks
Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in tra...
Erik G. Hoel, Wee-Liang Heng, Dale Honeycutt
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
13 years 11 months ago
Unification of Temporal Data Models
To add time su port to the relational model, both first normal form (fNF and non-INF appmches have maining within 1NF when time support is added may introduce data redundancy. The...
Christian S. Jensen, Michael D. Soo, Richard T. Sn...