Sciweavers

3415 search results - page 415 / 683
» Lower bounds on kernelization
Sort
View
ICDT
2001
ACM
114views Database» more  ICDT 2001»
15 years 11 months ago
Subsumption for XML types
XML data is often used (validated, stored, queried, etc) with respect to di erent types. Understanding the relationship between these types can provide important information for ma...
Gabriel M. Kuper, Jérôme Siméo...
170
Voted
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
15 years 11 months ago
On-Line Multicasting in All-Optical Networks
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
148
Voted
ICCAD
2000
IEEE
100views Hardware» more  ICCAD 2000»
15 years 11 months ago
Automated Data Dependency Size Estimation with a Partially Fixed Execution Ordering
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
15 years 11 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
John Howse, Fernando Molina, John Taylor
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
15 years 11 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...