3946 search results - page 295 / 790 » The computational complexity of choice sets |
155
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
146
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract-- Detecting and isolating multiple faults is a computationally intense task which typically consists of computing a set of tests, and then computing the diagnoses based on...
210
click to vote
RTSS
2007
IEEE
16 years 1 months ago
2007
IEEE
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the general-purpose and embedded system market. The devel...
183
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
150
click to vote
CHI
2006
ACM
16 years 7 months ago
2006
ACM
With the rapid growth of personal computer networks and the Internet, sharing files has become a central activity in computer use. The ways in which users control the what, how, a...