Sciweavers

3172 search results - page 517 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
RTA
2010
Springer
15 years 10 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
DILS
2008
Springer
15 years 8 months ago
VisGenome and Ensembl: Usability of Integrated Genome Maps
It is not always clear how best to represent integrated data sets, and which application and database features allow a scientist to take best advantage of data coming from various ...
Joanna Jakubowska, Ela Hunt, John McClure, Matthew...
ETVC
2008
15 years 8 months ago
Abstracts of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
Frank Nielsen
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
15 years 7 months ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
SBBD
2004
119views Database» more  SBBD 2004»
15 years 7 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