849 search results - page 92 / 170 » On the Complexity of the Whitehead Minimization Problem |
HCI
2007
13 years 9 months ago
2007
Responding to computer-initiated notifications requires a shift in attention that disrupts the flow of work. The degree of cost associated with resuming the original task following...
RSS
2007
13 years 9 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
COLING
2000
13 years 9 months ago
2000
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Bush fires cause major damage each year in many areas of the world and the earlier that they can be detected the easier it is to minimize this damage. This paper describes a coll...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...