Sciweavers

1026 search results - page 4 / 206
» On Finding Minimal w-cutset
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 1 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
ICPPW
2002
IEEE
14 years 19 days ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
FCT
2001
Springer
14 years 6 days ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...