Sciweavers

2434 search results - page 166 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
129
Voted
DASFAA
2011
IEEE
197views Database» more  DASFAA 2011»
14 years 7 months ago
Finding the Sites with Best Accessibilities to Amenities
Abstract. Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as s...
Qianlu Lin, Chuan Xiao, Muhammad Aamir Cheema, Wei...
147
Voted
CGO
2006
IEEE
15 years 10 months ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
FOCS
2009
IEEE
15 years 7 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
120
Voted
ALT
2005
Springer
16 years 24 days ago
An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron
This paper deals with an unusual phenomenon where most machine learning algorithms yield good performance on the training set but systematically worse than random performance on th...
Adam Kowalczyk, Olivier Chapelle
INFOCOM
2011
IEEE
14 years 7 months ago
General capacity scaling of wireless networks
—We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions ...
Cheng Wang, Changjun Jiang, Xiang-Yang Li, ShaoJie...