Sciweavers

2200 search results - page 232 / 440
» Bloch's Constant is Computable
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
WG
2009
Springer
16 years 1 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
FOCS
2008
IEEE
16 years 29 days ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
Paul Beame, Dang-Trinh Huynh-Ngoc
ICAC
2007
IEEE
16 years 25 days ago
SLA Decomposition: Translating Service Level Objectives to System Level Thresholds
In today’s complex and highly dynamic computing environments, systems/services have to be constantly adjusted to meet Service Level Agreements (SLAs) and to improve resource uti...
Yuan Chen, Subu Iyer, Xue Liu, Dejan S. Milojicic,...
ICCV
2007
IEEE
16 years 25 days ago
Shape Priors using Manifold Learning Techniques
We introduce a non-linear shape prior for the deformable model framework that we learn from a set of shape samples using recent manifold learning techniques. We model a category o...
Patrick Etyngier, Florent Ségonne, Renaud K...