Sciweavers

405 search results - page 8 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
APBC
2004
132views Bioinformatics» more  APBC 2004»
13 years 9 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 26 days ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
PRL
2007
158views more  PRL 2007»
13 years 7 months ago
Stability and convergence of the level set method in computer vision
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
Kunal N. Chaudhury, K. R. Ramakrishnan
CONSTRAINTS
2007
89views more  CONSTRAINTS 2007»
13 years 7 months ago
Cardinal: A Finite Sets Constraint Solver
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Francisco Azevedo
ICTIR
2009
Springer
14 years 2 months ago
"A term is known by the company it keeps": On Selecting a Good Expansion Set in Pseudo-Relevance Feedback
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...
Raghavendra Udupa, Abhijit Bhole, Pushpak Bhattach...