Sciweavers

3452 search results - page 669 / 691
» On the Study of Negotiation Strategies
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
13 years 11 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
BMCBI
2008
149views more  BMCBI 2008»
13 years 11 months ago
All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...
Antti Airola, Sampo Pyysalo, Jari Björne, Tap...
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 11 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 11 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 11 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf