Sciweavers

1404 search results - page 259 / 281
» Complexity of admissible rules
Sort
View
SBBD
2004
119views Database» more  SBBD 2004»
13 years 10 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
GG
2008
Springer
13 years 9 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
SIGCOMM
2010
ACM
13 years 8 months ago
c-Through: part-time optics in data centers
Data-intensive applications that operate on large volumes of data have motivated a fresh look at the design of data center networks. The first wave of proposals focused on designi...
Guohui Wang, David G. Andersen, Michael Kaminsky, ...
BMCBI
2010
148views more  BMCBI 2010»
13 years 8 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...
PAMI
2006
132views more  PAMI 2006»
13 years 8 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...