Sciweavers

198 search results - page 35 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
OPODIS
2010
14 years 8 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak
CORR
2010
Springer
44views Education» more  CORR 2010»
14 years 10 months ago
Evolution of National Nobel Prize Shares in the 20th Century
We analyze the evolution of cumulative national shares of Nobel Prizes since 1901, properly taking into account that most prizes were divided among several laureates. We rank by c...
Jürgen Schmidhuber
179
Voted
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
15 years 11 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
15 years 4 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
COMPGEOM
2007
ACM
14 years 12 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
Julien Demouth, Olivier Devillers, Hazel Everett, ...