Sciweavers

9842 search results - page 1378 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
DATE
2008
IEEE
134views Hardware» more  DATE 2008»
16 years 1 months ago
Adaptive Filesystem Compression for Embedded Systems
Abstract—Embedded system secondary storage size is often constrained, yet storage demands are growing as a result of increasing application complexity and storage of personal dat...
Lan S. Bai, Haris Lekatsas, Robert P. Dick
FOCS
2008
IEEE
16 years 1 months ago
Hardness of Minimizing and Learning DNF Expressions
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
Subhash Khot, Rishi Saket
ICC
2008
IEEE
130views Communications» more  ICC 2008»
16 years 1 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
ICDCS
2008
IEEE
16 years 1 months ago
Multi-Site Retrieval of Declustered Data
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to furth...
Ali Saman Tosun
ICSM
2008
IEEE
16 years 1 months ago
Supporting software evolution analysis with historical dependencies and defect information
More than 90% of the cost of software is due to maintenance and evolution. Understanding the evolution of large software systems is a complex problem, which requires the use of va...
Marco D'Ambros
« Prev « First page 1378 / 1969 Last » Next »