Sciweavers

7 search results - page 1 / 2
» A Randomized Algorithm for Two Servers in Cross Polytope Spa...
Sort
View
WAOA
2007
Springer
120views Algorithms» more  WAOA 2007»
13 years 11 months ago
A Randomized Algorithm for Two Servers in Cross Polytope Spaces
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawre...
CIKM
2009
Springer
13 years 9 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
13 years 9 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
13 years 11 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 6 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin