Sciweavers

2310 search results - page 331 / 462
» Coloring Random Graphs
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 4 days ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
JDWM
2010
180views more  JDWM 2010»
13 years 6 months ago
Investigating the Properties of a Social Bookmarking and Tagging Network
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
Ralitsa Angelova, Marek Lipczak, Evangelos E. Mili...
TCOM
2010
109views more  TCOM 2010»
13 years 6 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
ICC
2007
IEEE
145views Communications» more  ICC 2007»
14 years 2 months ago
Enhancements to Cognitive Radio Based IEEE 802.22 Air-Interface
—The IEEE 802.22 standard for wireless regional area network is the first standard for cognitive radio that tries to harness the idle or under-utilized spectrum allocated for TV...
Shamik Sengupta, Swastik Brahma, Mainak Chatterjee...
BVAI
2007
Springer
14 years 2 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...