Sciweavers

380 search results - page 71 / 76
» Instance Matching with COMA
Sort
View
CSB
2003
IEEE
118views Bioinformatics» more  CSB 2003»
14 years 27 days ago
Automated Protein NMR Resonance Assignments
NMR resonance peak assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protei...
Xiang Wan, Dong Xu, Carolyn M. Slupsky, Guohui Lin
ICALP
2010
Springer
14 years 12 days ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
EDBT
2009
ACM
116views Database» more  EDBT 2009»
14 years 7 days ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...
AGENTS
2001
Springer
14 years 3 days ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
LLL
1999
Springer
13 years 12 months ago
Learning to Lemmatise Slovene Words
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
Saso Dzeroski, Tomaz Erjavec