Sciweavers

1985 search results - page 58 / 397
» Multiresolution Analysis of Connectivity
Sort
View
ICDM
2007
IEEE
150views Data Mining» more  ICDM 2007»
14 years 2 months ago
Connections between Mining Frequent Itemsets and Learning Generative Models
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ra...
CPAIOR
2007
Springer
14 years 2 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
ICPP
1994
IEEE
14 years 4 hour ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
IWCMC
2010
ACM
13 years 9 months ago
Using connection expansion to reduce control traffic in MANETs
We consider the problem of control traffic overhead in MANETs with long-lived connections, operating under a reactive routing protocol (e.g. AODV). In such settings, control traff...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
ADHOC
2008
183views more  ADHOC 2008»
13 years 8 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali