933 search results - page 117 / 187 » Monotone Complexity of a Pair |
DCG
2008
13 years 9 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
CSCW
2002
ACM
13 years 9 months ago
2002
ACM
Current perceptions of Instant Messaging (IM) use are based primarily on self-report studies. We logged thousands of (mostly) workplace IM conversations and evaluated their conver...
JMLR
2002
13 years 9 months ago
2002
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
TCS
1998
13 years 9 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...