Sciweavers

1507 search results - page 284 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
116
Voted
OOIS
1994
Springer
15 years 6 months ago
Problems, Descriptions and Objects
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
Michael Jackson
EDBT
2009
ACM
138views Database» more  EDBT 2009»
15 years 9 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
145
Voted
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 4 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 2 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
EDBT
2002
ACM
125views Database» more  EDBT 2002»
16 years 2 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish