Sciweavers

24451 search results - page 4828 / 4891
» Research methods in information
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
HOTOS
2007
IEEE
15 years 1 months ago
HotComments: How to Make Program Comments More Useful?
Program comments have long been used as a common practice for improving inter-programmer communication and code readability, by explicitly specifying programmers' intentions ...
Lin Tan, Ding Yuan, Yuanyuan Zhou
GLOBECOM
2009
IEEE
15 years 1 months ago
Effective Capacity Analysis of Cognitive Radio Channels for Quality of Service Provisioning
In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that the secondary transmitter sen...
Sami Akin, Mustafa Cenk Gursoy
AINA
2004
IEEE
15 years 1 months ago
An Efficient Clustered Architecture for P2P Networks
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some ...
Juan Li, Son T. Vuong
ANTS
2006
Springer
73views Algorithms» more  ANTS 2006»
15 years 1 months ago
The Elliptic Curve Database for Conductors to 130000
Abstract. Tabulating elliptic curves has been carried out since the earliest days of machine computation in number theory. After some historical remarks, we report on significant r...
John Cremona
« Prev « First page 4828 / 4891 Last » Next »