Sciweavers

405 search results - page 5 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
RIBRA-An Error-Tolerant Algorithm for the NMR Backbone Assignment Problem
We develop an iterative relaxation algorithm, called RIBRA, for NMR protein backbone assignment. RIBRA applies nearest neighbor and weighted maximum independent set algorithms to ...
Kuen-Pin Wu, Jia-Ming Chang, Jun-Bo Chen, Chi-Fon ...
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 1 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
OTM
2004
Springer
14 years 25 days ago
Revising and Managing Multiple Ontology Versions in a Possible Worlds Setting
Abstract. To date, ontology research seems to have come to an equilibrium: there is a wide variety of theories, methods and tools for extracting, representing, storing and browsing...
Pieter De Leenheer
CPC
2006
110views more  CPC 2006»
13 years 7 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 7 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey