Sciweavers

177 search results - page 20 / 36
» The Middle Product Algorithm I
Sort
View
COMPGEOM
2004
ACM
15 years 5 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
KDD
2006
ACM
222views Data Mining» more  KDD 2006»
16 years 4 days ago
A component-based framework for knowledge discovery in bioinformatics
Motivation: In the field of bioinformatics there is an emerging need to integrate all knowledge discovery steps into a standardized modular framework. Indeed, component-based deve...
Julien Etienne, Bernd Wachmann, Lei Zhang
BMCBI
2010
176views more  BMCBI 2010»
14 years 12 months ago
TargetSpy: a supervised machine learning approach for microRNA target prediction
Background: Virtually all currently available microRNA target site prediction algorithms require the presence of a (conserved) seed match to the 5' end of the microRNA. Recen...
Martin Sturm, Michael Hackenberg, David Langenberg...
SIGIR
2006
ACM
15 years 5 months ago
Identifying comparative sentences in text documents
This paper studies the problem of identifying comparative sentences in text documents. The problem is related to but quite different from sentiment/opinion sentence identification...
Nitin Jindal, Bing Liu
ATAL
2008
Springer
15 years 1 months ago
A statistical relational model for trust learning
We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several ...
Achim Rettinger, Matthias Nickles, Volker Tresp