10608 search results - page 185 / 2122 » Complexity of O'Hara's Algorithm |
163
click to vote
JDA
2011
15 years 1 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
204
click to vote
JMLR
2012
13 years 9 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
157
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
188
click to vote
IJRR
2006
15 years 6 months ago
2006
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
299
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...