Sciweavers

27692 search results - page 5482 / 5539
» Where is ...
Sort
View
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
ICALP
2011
Springer
12 years 11 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
ICALP
2011
Springer
12 years 11 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
ICS
2011
Tsinghua U.
12 years 11 months ago
Hystor: making the best use of solid state drives in high performance storage systems
With the fast technical improvement, flash memory based Solid State Drives (SSDs) are becoming an important part of the computer storage hierarchy to significantly improve perfo...
Feng Chen, David A. Koufaty, Xiaodong Zhang
ICSE
2011
IEEE-ACM
12 years 11 months ago
Miler: a toolset for exploring email data
Source code is the target and final outcome of software development. By focusing our research and analysis on source code only, we risk forgetting that software is the product of...
Alberto Bacchelli, Michele Lanza, Marco D'Ambros
« Prev « First page 5482 / 5539 Last » Next »