Sciweavers

3946 search results - page 618 / 790
» The computational complexity of choice sets
Sort
View
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 6 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
MFCS
2004
Springer
15 years 12 months ago
Captive Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Guillaume Theyssier
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 10 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
SIGMOD
1997
ACM
131views Database» more  SIGMOD 1997»
15 years 10 months ago
Maintenance of Data Cubes and Summary Tables in a Warehouse
Data warehouses contain large amounts of information, often collected from a variety of independent sources. Decision-support functions in a warehouse, such as on-line analytical ...
Inderpal Singh Mumick, Dallan Quass, Barinderpal S...
APVIS
2007
15 years 8 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...