Sciweavers

3311 search results - page 27 / 663
» Modeling Relational Data by the Adjacency Model
Sort
View
VLDB
1987
ACM
75views Database» more  VLDB 1987»
14 years 15 days ago
The POSTGRES Data Model
The design of the POSTGRES data model is described. The data model is a relational model that has been extended with abstract data types including user-defined operators and proce...
Lawrence A. Rowe, Michael Stonebraker
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
13 years 17 days ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
CVPR
2007
IEEE
14 years 11 months ago
Learning and Matching Line Aspects for Articulated Objects
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
Xiaofeng Ren
ICC
2007
IEEE
117views Communications» more  ICC 2007»
14 years 3 months ago
Performance Modeling of Multi-Rate HDR and its Effect on TCP Throughput
—An interesting feature of the 3G cellular networks is their ability to support multiple data rates. Though the performance of TCP over wireless networks has been well studied, t...
Wenjing Wang, Shamik Sengupta, Mainak Chatterjee
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
14 years 3 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...