4201 search results - page 201 / 841 » Interaction graphs: Additives |
160
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
172
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
164
click to vote
COCO
2009
Springer
16 years 22 days ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
152
Voted
DSD
2007
IEEE
16 years 15 days ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
171
click to vote
ICDM
2007
IEEE
16 years 14 days ago
2007
IEEE
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...