Sciweavers

1968 search results - page 39 / 394
» The Complexity of Valued Constraint Models
Sort
View
ADBIS
2003
Springer
204views Database» more  ADBIS 2003»
15 years 5 months ago
Hierarchical Bitmap Index: An Efficient and Scalable Indexing Technique for Set-Valued Attributes
Abstract. Set-valued attributes are convenient to model complex objects occurring in the real world. Currently available database systems support the storage of set-valued attribut...
Mikolaj Morzy, Tadeusz Morzy, Alexandros Nanopoulo...
MICRO
2006
IEEE
84views Hardware» more  MICRO 2006»
15 years 7 months ago
Reunion: Complexity-Effective Multicore Redundancy
To protect processor logic from soft errors, multicore redundant architectures execute two copies of a program on separate cores of a chip multiprocessor (CMP). Maintaining identi...
Jared C. Smolens, Brian T. Gold, Babak Falsafi, Ja...
CP
2006
Springer
15 years 5 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
VLDB
1987
ACM
72views Database» more  VLDB 1987»
15 years 4 months ago
Providing Time-Related Constraints for Conventional Database Systems
A model for a historical database is described which is based upon time-stamped tuples as the unit of storage. The model includes both physical and logical time-stamps. The techni...
T. Abbod, K. Brown, H. Noble
MICCAI
2004
Springer
16 years 2 months ago
Construction of 3D Dynamic Statistical Deformable Models for Complex Topological Shapes
Abstract. This paper describes the construction of 3D dynamic statistical deformable models for complex topological shapes. It significantly extents the existing framework in that ...
Paramate Horkaew, Guang-Zhong Yang