Sciweavers

4429 search results - page 465 / 886
» An Algorithm for Knowledge Base Extraction
Sort
View
ICPR
2006
IEEE
16 years 8 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
JMLR
2010
185views more  JMLR 2010»
15 years 1 months ago
HMMPayl: an application of HMM to the analysis of the HTTP Payload
Zero-days attacks are one of the most dangerous threats against computer networks. These, by definition, are attacks never seen before. Thus, defense tools based on a database of ...
Davide Ariu, Giorgio Giacinto
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
15 years 7 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 6 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
ESA
2010
Springer
197views Algorithms» more  ESA 2010»
15 years 4 months ago
How to Allocate Goods in an Online Market?
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
Yossi Azar, Niv Buchbinder, Kamal Jain