Sciweavers

2434 search results - page 251 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 4 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
113
Voted
RECOMB
1999
Springer
15 years 8 months ago
Classifying proteins by family using the product of correlated p-values
An important goal in bioinformatics is determining the homology and function of proteins from their sequences. Pairwise sequence similarity algorithms are often employed for this ...
Timothy L. Bailey, William Noble Grundy
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
15 years 11 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 10 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
143
Voted
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
15 years 7 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...