Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
46
search results - page 10 / 10
»
Maximizing Non-Monotone Submodular Functions
Sort
relevance
views
votes
recent
update
View
thumb
title
136
Voted
FSTTCS
2009
Springer
168
views
Software Engineering
»
more
FSTTCS 2009
»
Bounded Size Graph Clustering with Applications to Stream Processing
15 years 7 months ago
Download
drops.dagstuhl.de
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
claim paper
Read More »
« Prev
« First
page 10 / 10
Last »
Next »