Sciweavers

305 search results - page 9 / 61
» From Sets to Bits in Coq
Sort
View
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
15 years 10 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
TROB
2002
75views more  TROB 2002»
14 years 10 months ago
Stable limit sets in a dynamic parts feeder
We describe a one-joint planar arm which repeatedly throws and catches parts on its surface, and we demonstrate that proper choice of the throw velocity and arm geometry guarantees...
Kevin M. Lynch, Michael Northrop, Peng Pan
ISNN
2005
Springer
15 years 4 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
SPAA
2010
ACM
14 years 11 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
PE
2007
Springer
114views Optimization» more  PE 2007»
14 years 10 months ago
Performance analysis of BitTorrent-like systems with heterogeneous users
Among all peer-to-peer (P2P) systems, BitTorrent seems to be the most prevalent one. This success has drawn a great deal of research interest on the system. In particular, there h...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...