Sciweavers

1918 search results - page 208 / 384
» Discovering Cortical Algorithms
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
MLDM
2007
Springer
14 years 3 months ago
Nonlinear Feature Selection by Relevance Feature Vector Machine
Support vector machine (SVM) has received much attention in feature selection recently because of its ability to incorporate kernels to discover nonlinear dependencies between feat...
Haibin Cheng, Haifeng Chen, Guofei Jiang, Kenji Yo...
GFKL
2005
Springer
114views Data Mining» more  GFKL 2005»
14 years 2 months ago
Attribute-aware Collaborative Filtering
One of the key challenges in large information systems such as online shops and digital libraries is to discover the relevant knowledge from the enormous volume of information. Rec...
Karen H. L. Tso, Lars Schmidt-Thieme
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
14 years 2 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 2 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz