Sciweavers

2907 search results - page 187 / 582
» Presentations of Structures in Admissible Sets
Sort
View
CIKM
1997
Springer
15 years 10 months ago
An Analysis of Cardinality Constraints in Redundant Relationships
In this paper, we present a complete analysis of redundant relationships in the entity-relationship model. Existing approaches use the concept of functional dependencies for ident...
James Dullea, Il-Yeol Song
ECCV
2008
Springer
16 years 8 months ago
Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs
This paper presents an approach for modeling landmark sites such as the Statue of Liberty based on large-scale contaminated image collections gathered from the Internet. Our system...
Xiaowei Li, Changchang Wu, Christopher Zach, Svetl...
EUROSYS
2007
ACM
16 years 3 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
IDEAS
2005
IEEE
142views Database» more  IDEAS 2005»
16 years 4 days ago
Automatically Maintaining Wrappers for Web Sources
A substantial subset of the web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents...
Juan Raposo, Alberto Pan, Manuel Álvarez, J...
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
16 years 1 days ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen