Sciweavers

943 search results - page 65 / 189
» How should data structures and algorithms be taught
Sort
View
ICDM
2010
IEEE
132views Data Mining» more  ICDM 2010»
14 years 7 months ago
Monotone Relabeling in Ordinal Classification
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attrib...
Ad Feelders
CORR
2010
Springer
91views Education» more  CORR 2010»
14 years 4 months ago
Switching between Hidden Markov Models using Fixed Share
In prediction with expert advice the goal is to design online prediction algorithms that achieve small regret (additional loss on the whole data) compared to a reference scheme. I...
Wouter M. Koolen, Tim van Erven
BMCBI
2005
125views more  BMCBI 2005»
14 years 9 months ago
Query3d: a new method for high-throughput analysis of functional residues in protein structures
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...
Gabriele Ausiello, Allegra Via, Manuela Helmer-Cit...
ECIR
2009
Springer
14 years 7 months ago
Refining Keyword Queries for XML Retrieval by Combining Content and Structure
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
Desislava Petkova, W. Bruce Croft, Yanlei Diao
ICIP
2004
IEEE
15 years 11 months ago
Redundant image representations in security applications
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
Philippe Jost, Pierre Vandergheynst, Pascal Frossa...