9842 search results - page 379 / 1969 » The Complexity of the Matching-Cut Problem |
128
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
138
click to vote
NIPS
2004
15 years 5 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
127
click to vote
ACL
1993
15 years 5 months ago
1993
This paper describes the problems faced while using Kimmo's two-level model to describe certain Indian languages such as Tamil and Hindi. The two-level model is shown to be d...
103
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
: One of the main practical problems on cooperative robots is the complexity of integrating a large amount of expensive velocity/force sensors. In this paper, the control of cooper...
114
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...