Sciweavers

8647 search results - page 609 / 1730
» The Container Selection Problem
Sort
View
ICFCA
2009
Springer
15 years 11 months ago
A Novel Approach to Cell Formation
We present an approach to the cell formation problem, known from group technology, which is inspired by formal concept analysis. The cell formation problem consists in allocating p...
Radim Belohlávek, Niranjan Kulkarni, Vil&ea...
ISAAC
2009
Springer
87views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Parameterizing Cut Sets in a Graph by the Number of Their Components
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
Takehiro Ito, Marcin Kaminski, Daniël Paulusm...
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 11 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
DASFAA
2006
IEEE
135views Database» more  DASFAA 2006»
15 years 10 months ago
An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
Juzhen He, Wilfred Ng, Xiaoling Wang, Aoying Zhou
CSR
2008
Springer
15 years 9 months ago
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
Nutan Limaye, Meena Mahajan, Antoine Meyer