Results 21 - 30 of 18,132

SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks

by Paramvir Bahl, Ranveer Chandra - in IEEE 802.11 Ad-Hoc Wireless Networks,” in ACM Mobicom , 2004
"... Capacity improvement is one of the principal challenges in wireless networking. We present a link-layer protocol called Slotted Seeded Channel Hopping, or SSCH, that increases the capacity of an IEEE 802.11 network by utilizing frequency diversity. SSCH can be implemented in software over an IEEE 80 ..."
Abstract - Cited by 353 (3 self) - Add to MetaCart
802.11-compliant wireless card. Each node using SSCH switches across channels in such a manner that nodes desiring to communicate overlap, while disjoint communications mostly do not overlap, and hence do not interfere with each other. To achieve this, SSCH uses a novel scheme for distributed

New Directions in Traffic Measurement and Accounting

by Cristian Estan, George Varghese , 2001
"... Accurate network traffic measurement is required for accounting, bandwidth provisioning, and detecting DOS attacks. However, keeping a counter to measure the traffic sent by each of a million concurrent flows is too expensive (using SRAM) or slow (using DRAM). The current state-of-the-art (e.g., Cis ..."
Abstract - Cited by 353 (11 self) - Add to MetaCart
showing that a number of simple solutions based on cached counters and classical sampling do not work, we describe two novel and scalable schemes for this purpose which take a constant number of memory references per packet and use a small amount of memory. Further, unlike NetFlow estimates, we have

Nested Linear/Lattice Codes for Structured Multiterminal Binning

by Ram Zamir, Shlomo Shamai (Shitz), Uri Erez , 2002
"... Network information theory promises high gains over simple point-to-point communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning sch ..."
Abstract - Cited by 345 (14 self) - Add to MetaCart
Network information theory promises high gains over simple point-to-point communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning

Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems

by Kien A. Hua, Simon Sheu , 1997
"... We investigate a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications. We discuss the data fragmentation technique, the broadcasting strategy, and the client design. We also show the correctness of our technique, and derive mathematical equations to analyz ..."
Abstract - Cited by 307 (20 self) - Add to MetaCart
We investigate a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications. We discuss the data fragmentation technique, the broadcasting strategy, and the client design. We also show the correctness of our technique, and derive mathematical equations

An identity based encryption scheme based on quadratic residues

by Clifford Cocks - IN IMA INT. CONF , 2001
"... We present a novel public key cryptosystem in which the public key of a subscriber can be chosen to be a publicly known value, such as his identity. We discuss the security of the proposed scheme, and show that this is related to the difficulty of solving the quadratic residuosity problem. ..."
Abstract - Cited by 284 (0 self) - Add to MetaCart
We present a novel public key cryptosystem in which the public key of a subscriber can be chosen to be a publicly known value, such as his identity. We discuss the security of the proposed scheme, and show that this is related to the difficulty of solving the quadratic residuosity problem.

A new routing protocol for reconfigurable wireless networks

by Zygmunt J Haas - Proceedings of the IEEE International Conference on Universal Personal Communications (ICUPC , 1997
"... ABSTRACT: In this paper, we propose a new routing protocol, the Zone Routing Protocol (ZRP), for the Reconfigurable Wireless Networks, a large scale, highly mobile ad-hoc networking environment. The novelty of the ZRP protocol is that it is applicable to large Plat-routed networks. Furthermore, thr ..."
Abstract - Cited by 318 (5 self) - Add to MetaCart
, through the use of the zone radius parameter, the scheme exhibits adjustable hybrid behavior of proactive and reactive routing schemes. We evaluate the performance of the protocol, showing the reduction in the number of control messages, as compared with other reactive schemes, such as flooding.

Speeded-Up Robust Features (SURF)

by Herbert Bay , Andreas Ess , Tinne Tuytelaars , Luc Van Gool , B K. U. Leuven , 2008
"... This article presents a novel scale- and rotation-invariant detector and descriptor, coined SURF (Speeded-Up Robust Features). SURF approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be computed and compared much faste ..."
Abstract - Cited by 313 (5 self) - Add to MetaCart
This article presents a novel scale- and rotation-invariant detector and descriptor, coined SURF (Speeded-Up Robust Features). SURF approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be computed and compared much

Efficient routing in intermittently connected mobile networks: The multiple-copy case

by Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra , 2008
"... Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc net ..."
Abstract - Cited by 303 (18 self) - Add to MetaCart
networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery

On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

by Kambiz Azarian, Hesham El Gamal, Philip Schniter - IEEE TRANS. INFORM. THEORY , 2005
"... We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up-lin ..."
Abstract - Cited by 311 (11 self) - Add to MetaCart
We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up

Face recognition with local binary patterns

by Timo Ahonen, Abdenour Hadid, Matti Pietikäinen - In Proc. of 9th Euro15 We
"... Abstract. In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small regions from which Local Binary Pattern (LBP) histograms are extracted and concatenated into a single, spatia ..."
Abstract - Cited by 302 (15 self) - Add to MetaCart
Abstract. In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small regions from which Local Binary Pattern (LBP) histograms are extracted and concatenated into a single
Results 21 - 30 of 18,132