Sciweavers

10271 search results - page 327 / 2055
» Self-plagiarism in computer science
Sort
View
FOCS
2009
IEEE
16 years 2 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
STACS
2007
Springer
16 years 1 months ago
Rank-1 Modal Logics Are Coalgebraic
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of
Lutz Schröder, Dirk Pattinson
187
Voted
STACS
2007
Springer
16 years 1 months ago
On Symmetric Signatures in Holographic Algorithms
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmet
Jin-yi Cai, Pinyan Lu
FOCS
2006
IEEE
16 years 1 months ago
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
We investigate variants of Lloyd’s heuristic for clustering high dimensional data in an attempt to explain its popular
Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulma...
TAICPART
2006
IEEE
183views Education» more  TAICPART 2006»
16 years 1 months ago
AutoAbstract: Problem Statement and Hypothetical Solutions
ract: Problem Statement and Hypothetical Solutions Shaukat Ali Verification and Testing Group (VT) Department of Computer Science University of Sheffield
Shaukat Ali