3172 search results - page 40 / 635 » On the Random-Self-Reducibility of Complete Sets |
108
click to vote
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
101
Voted
TCS
1998
15 years 9 days 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...
105
Voted
CSB
2005
IEEE
15 years 6 months ago
2005
IEEE
Experimental processes to collect and process proteomics data are increasingly complex, while the computational methods to assess the quality and significance of these data remain...
129
click to vote
TASLP
2002
15 years 9 days ago
2002
This paper presents a set of corpus-based text-to-speech synthesis technologies for Mandarin Chinese. A large speech corpus produced by a single speaker is used, and the speech out...
132
Voted
JELIA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...