Sciweavers

3168 search results - page 280 / 634
» Neutrosophic Relational Data Model
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 12 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
SBBD
2004
119views Database» more  SBBD 2004»
15 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
CVPR
2009
IEEE
16 years 1 months ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter
TAMC
2009
Springer
16 years 1 months ago
The Extended Turing Model as Contextual Tool
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
S. Barry Cooper
VL
2010
IEEE
209views Visual Languages» more  VL 2010»
15 years 5 months ago
Automatically Inferring ClassSheet Models from Spreadsheets
Many errors in spreadsheet formulas can be avoided if spreadsheets are built automatically from higher-level models that can encode and enforce consistency constraints. However, d...
Jacome Cunha, Martin Erwig, Joao Saraiva