Sciweavers

7522 search results - page 280 / 1505
» Spacing memetic algorithms
Sort
View
EMNLP
2008
15 years 8 months ago
Cross-Task Knowledge-Constrained Self Training
We present an algorithmic framework for learning multiple related tasks. Our framework exploits a form of prior knowledge that relates the output spaces of these tasks. We present...
Hal Daumé III
ADCM
2007
168views more  ADCM 2007»
15 years 6 months ago
A generalization of Gram-Schmidt orthogonalization generating all Parseval frames
Given an arbitrary finite sequence of vectors in a finite–dimensional Hilbert space, we describe an algorithm, which computes a Parseval frame for the subspace generated by the...
Peter G. Casazza, Gitta Kutyniok
IJUFKS
2002
70views more  IJUFKS 2002»
15 years 6 months ago
Software Systems for Tabular Data Releases
aint on disclosure risk. Underlying abstractions -- primarily associated with the query space, as well as released and unreleasable sub-tables and frontiers, computational algorith...
Adrian Dobra, Alan F. Karr, Ashish P. Sanil, Steph...
TCS
2010
15 years 5 months ago
Euclidean TSP on two polygons
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
Jeff Abrahamson, Ali Shokoufandeh
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík