Sciweavers

572 search results - page 92 / 115
» Exponential-Time Approximation of Hard Problems
Sort
View
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 1 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
COMPGEOM
2006
ACM
15 years 4 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
FASE
2009
Springer
15 years 4 months ago
HAVE: Detecting Atomicity Violations via Integrated Dynamic and Static Analysis
Abstract. The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Atomicity violation, which is ...
Qichang Chen, Liqiang Wang, Zijiang Yang, Scott D....
ICFCA
2007
Springer
15 years 4 months ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
WIOPT
2005
IEEE
15 years 3 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...