Sciweavers

926 search results - page 8 / 186
» Algorithms on Ideal over Complex Multiplication order
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 10 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
COCO
1989
Springer
110views Algorithms» more  COCO 1989»
15 years 1 months ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
Neil Immerman, Susan Landau
73
Voted
AMAI
2006
Springer
14 years 9 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
ICDE
2007
IEEE
136views Database» more  ICDE 2007»
15 years 10 months ago
Norm, Point, and Distance Estimation Over Multiple Signals Using Max-Stable Distributions
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
Stilian Stoev, Marios Hadjieleftheriou, George Kol...
67
Voted
ICMCS
2006
IEEE
154views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Implementation and Evolution of Packet Striping for Media Streaming Over Multiple Burst-Loss Channels
Modern mobile devices are multi-homed with WLAN and WWAN communication interfaces. In a community of nodes with such multihomed devices — locally inter-connected via high-speed ...
Gene Cheung, Puneet Sharma, Sung-Ju Lee