Sciweavers

2168 search results - page 130 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
FOCS
2008
IEEE
15 years 5 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
IACR
2011
116views more  IACR 2011»
14 years 3 months ago
Some Words About Cryptographic Key Recognition In Data Streams
Search for cryptographic keys in RAM is a new and prospective technology which can be used, primarily, in the computer forensics. In order to use it, a cryptanalyst must solve, at...
Alexey Chilikov, Evgeny Alekseev
MOBICOM
2010
ACM
15 years 4 months ago
Design and experimental evaluation of multi-user beamforming in wireless LANs
Multi-User MIMO promises to increase the spectral efficiency of next generation wireless systems and is currently being incorporated in future industry standards. Although a signi...
Ehsan Aryafar, Narendra Anand, Theodoros Salonidis...
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
15 years 2 months ago
An automated, yet interactive and portable DB designer
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
Ioannis Alagiannis, Debabrata Dash, Karl Schnaitte...
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
15 years 10 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki