175 search results - page 33 / 35 » max-cut and Containment Relations in Graphs |
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
94
Voted
MLG
2007
Springer
15 years 8 months ago
2007
Springer
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
157
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
132
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
156
Voted
PODS
1994
ACM
15 years 5 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...