Sciweavers

849 search results - page 82 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
COMCOM
2010
118views more  COMCOM 2010»
13 years 5 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
TSP
2012
12 years 3 months ago
Sensing and Probing Cardinalities for Active Cognitive Radios
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, ...
ICIP
2003
IEEE
14 years 9 months ago
Optimal framework for low bit-rate block coders
Block coders are among the most common compression tools available for still images and video sequences. Their low computational complexity along with their good performance make ...
Yaakov Tsaig, Michael Elad, Gene H. Golub, Peyman ...
ICDCSW
2007
IEEE
14 years 2 months ago
Event Stream Processing with Out-of-Order Data Arrival
Complex event processing has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. The goa...
Ming Li, Mo Liu, Luping Ding, Elke A. Rundensteine...
ICFCA
2007
Springer
14 years 2 months ago
Some Notes on Pseudo-closed Sets
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
Sebastian Rudolph