Sciweavers

37 search results - page 4 / 8
» Counting independent sets up to the tree threshold
Sort
View
ICC
2009
IEEE
137views Communications» more  ICC 2009»
13 years 7 months ago
Distributed Multi-User Scheduling for Improving Throughput of Wireless LAN
Carrier Sense Multi-Access (CSMA) is a typical method to share the common channel in a Wireless LAN (WLAN). It works fairly well in times of light traffic. However as the number of...
Suhua Tang, Ryu Miura, Sadao Obana
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
14 years 3 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee
ISWC
2003
IEEE
14 years 3 months ago
An Extended Menu Navigation Interface Using Multiple Pressure-Sensitive Strips
We present extensions and modifications that we have made to a cursorless menu navigation interface that is controlled by multiple pressure-sensitive linear strips. Our approach i...
Gábor Blaskó, Steven Feiner
FOCS
2005
IEEE
14 years 3 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
STACS
2001
Springer
14 years 2 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid