Sciweavers

427 search results - page 38 / 86
» Computing the Local Consensus of Trees
Sort
View
JFPLC
2004
15 years 6 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
NIPS
2007
15 years 6 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
167
Voted
CN
2007
154views more  CN 2007»
15 years 5 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
CIKM
2005
Springer
15 years 10 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
CVPR
2010
IEEE
16 years 1 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...