Sciweavers

14098 search results - page 2713 / 2820
» Crowd computer interaction
Sort
View
BMCBI
2006
75views more  BMCBI 2006»
13 years 9 months ago
A machine learning strategy to identify candidate binding sites in human protein-coding sequence
Background: The splicing of RNA transcripts is thought to be partly promoted and regulated by sequences embedded within exons. Known sequences include binding sites for SR protein...
Thomas Down, Bernard Leong, Tim J. P. Hubbard
CAD
2006
Springer
13 years 9 months ago
On visual similarity based 2D drawing retrieval
A large amount of 2D drawings have been produced in engineering fields. To reuse and share the available drawings efficiently, we propose two methods in this paper, namely 2.5D sp...
Jiantao Pu, Karthik Ramani
IJAR
2008
118views more  IJAR 2008»
13 years 9 months ago
Dynamic multiagent probabilistic inference
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
Xiangdong An, Yang Xiang, Nick Cercone
EXPERT
2006
84views more  EXPERT 2006»
13 years 9 months ago
Infrastructure for Engineered Emergence on Sensor/Actuator Networks
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
Jacob Beal, Jonathan Bachrach
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 9 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
« Prev « First page 2713 / 2820 Last » Next »