554 search results - page 58 / 111 » Power Domination Problem in Graphs |
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
PRICAI
2004
Springer
14 years 1 months ago
2004
Springer
Search has arguably become the dominant paradigm for finding information on the World Wide Web. In order to build a successful search engine, there are a number of challenges that ...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
ICCV
2003
IEEE
14 years 1 months ago
2003
IEEE
Detecting the dominant normal directions to the decision surface is an established technique for feature selection in high dimensional classification problems. Several approaches...