Sciweavers

736 search results - page 136 / 148
» Approximating the Number of Network Motifs
Sort
View
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 11 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
TMC
2008
112views more  TMC 2008»
13 years 10 months ago
Throughput Analysis and Measurements in IEEE 802.11 WLANs with TCP and UDP Traffic Flows
There is a vast literature on the throughput analysis of the IEEE 802.11 media access control (MAC) protocol. However, very little has been done on investigating the interplay betw...
Raffaele Bruno, Marco Conti, Enrico Gregori
SPAA
2003
ACM
14 years 4 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
VLDB
2001
ACM
114views Database» more  VLDB 2001»
14 years 3 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
INFOCOM
2009
IEEE
14 years 5 months ago
Searching for Stability in Interdomain Routing
—The Border Gateway Protocol (BGP) handles the task of establishing routes between the Autonomous Systems (ASes) that make up the Internet. It is known that it is possible for a ...
Rahul Sami, Michael Schapira, Aviv Zohar