Sciweavers

1923 search results - page 157 / 385
» Weighted Decision Trees
Sort
View
DKE
2007
136views more  DKE 2007»
15 years 6 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
BMCBI
2006
137views more  BMCBI 2006»
15 years 6 months ago
A classification-based framework for predicting and analyzing gene regulatory response
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
Anshul Kundaje, Manuel Middendorf, Mihir Shah, Chr...
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
16 years 6 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...
ICDAR
2003
IEEE
15 years 11 months ago
Multi-Expert Verification of Hand-Written Signatures
This paper presents a multi-expert system for dynamic signature verification. The system uses a stroke-oriented description of signatures well-suited for multi-expert approach. Ea...
L. Bovino, Sebastiano Impedovo, Giuseppe Pirlo, L....
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 11 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki