Sciweavers

8695 search results - page 439 / 1739
» Making the Complex Simple
Sort
View
DAM
2007
105views more  DAM 2007»
15 years 7 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
JMLR
2006
137views more  JMLR 2006»
15 years 7 months ago
Bounds for Linear Multi-Task Learning
Abstract. We give dimension-free and data-dependent bounds for linear multi-task learning where a common linear operator is chosen to preprocess data for a vector of task speci...c...
Andreas Maurer
GC
2007
Springer
15 years 7 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...
HEURISTICS
2007
103views more  HEURISTICS 2007»
15 years 7 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen
IPL
2007
50views more  IPL 2007»
15 years 7 months ago
Wait-free regular storage from Byzantine components
We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...