475 search results - page 7 / 95 » Z3-Connectivity with Independent Number 2 |
MOBISYS
2009
ACM
14 years 10 months ago
2009
ACM
We design, implement, and evaluate a vehicular communication system that improves uplink connectivity through multi-lobe beam pattern switching on a smart antenna. Directionality ...
STOC
1999
ACM
14 years 2 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
PODC
2005
ACM
14 years 3 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
DM
2000
13 years 9 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...