Sciweavers

2631 search results - page 155 / 527
» A Practical Method for the Sparse Resultant
Sort
View
BMCBI
2007
109views more  BMCBI 2007»
15 years 6 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
WILF
2007
Springer
125views Fuzzy Logic» more  WILF 2007»
16 years 14 days ago
Computational Humour: Utilizing Cross-Reference Ambiguity for Conversational Jokes
This paper presents a computer implementation that utilizes cross-reference ambiguity in utterances for simple conversational jokes. The approach is based on the SSTH. Using a simp...
Hans Wim Tinholt, Anton Nijholt
ICNP
2003
IEEE
15 years 11 months ago
A Bidding Protocol for Deploying Mobile Sensors
In some harsh environments, manually deploying sensors is impossible. Alternative methods may lead to imprecise placement resulting in coverage holes. To provide the required high...
Guiling Wang, Guohong Cao, Thomas F. La Porta
LREC
2008
174views Education» more  LREC 2008»
15 years 7 months ago
UnsuParse: unsupervised Parsing with unsupervised Part of Speech Tagging
Based on simple methods such as observing word and part of speech tag co-occurrence and clustering, we generate syntactic parses of sentences in an entirely unsupervised and self-...
Christian Hänig, Stefan Bordag, Uwe Quasthoff
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
15 years 11 months ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai