Matches in SemOpenAlex for { <https://semopenalex.org/work/W2308573658> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W2308573658 abstract "Proliferation of today's mobile and social applications has created a variety of logical large-scale networks. These include wireless networks that provide connectivity to billions of mobile devices, road networks that cover thousands of cities, and online social networks that connect more than half a billion people together. As more and more people rely on these applications to communicate and interact, these networks continue to grow rapidly. These large-scale networks raise significant challenges in computation tasks that support the emerging applications. First, due to their scale and complexity, computing tasks that run on these networks are often computational-intensive. Even the most basic problems such as finding the shortest path between two nodes takes hours to solve on a billion-node-graph. Not to mention approximating NP-hard optimization problems. Second, physical resources available to support these computing tasks, such as memory, human power, etc., are heavily constrained. A machine's physical memory can no longer hold an entire network graph, and it is cost-prohibitive to manually collect information to build a road graph. Finally, these networks are dynamically changing, and their applications require up-to-date results. One must design efficient pre-computation so that they can offer up-to-date results without significant overhead. Given these significant challenges in real-time graph computation, conventional solutions are no longer suitable or feasible to accomplish those tasks. We must design a new class of highly scalable algorithms that adapt to continual network dynamics. In this thesis, we investigate efficient algorithm design in three representative large-scale networks: wireless, road, and online social networks. Specifically, we design algorithms that allocate spectrum in wireless networks where devices dynamically share radio spectrum; we design algorithms that build a routable road map from a set of GPS traces collected from vehicles; we also design algorithms that compute approximate shortest paths in online social networks. Our work advances the state of the art by solving the above challenges in several emerging problems and inventing new techniques that potentially inspire future research on related problems." @default.
- W2308573658 created "2016-06-24" @default.
- W2308573658 creator A5026303574 @default.
- W2308573658 creator A5058710143 @default.
- W2308573658 date "2011-01-01" @default.
- W2308573658 modified "2023-09-27" @default.
- W2308573658 title "Efficient algorithms in emerging large-scale networks" @default.
- W2308573658 hasPublicationYear "2011" @default.
- W2308573658 type Work @default.
- W2308573658 sameAs 2308573658 @default.
- W2308573658 citedByCount "0" @default.
- W2308573658 crossrefType "journal-article" @default.
- W2308573658 hasAuthorship W2308573658A5026303574 @default.
- W2308573658 hasAuthorship W2308573658A5058710143 @default.
- W2308573658 hasConcept C108037233 @default.
- W2308573658 hasConcept C111919701 @default.
- W2308573658 hasConcept C11413529 @default.
- W2308573658 hasConcept C120314980 @default.
- W2308573658 hasConcept C127413603 @default.
- W2308573658 hasConcept C132525143 @default.
- W2308573658 hasConcept C136764020 @default.
- W2308573658 hasConcept C2779960059 @default.
- W2308573658 hasConcept C34947359 @default.
- W2308573658 hasConcept C36647736 @default.
- W2308573658 hasConcept C41008148 @default.
- W2308573658 hasConcept C45374587 @default.
- W2308573658 hasConcept C48044578 @default.
- W2308573658 hasConcept C555944384 @default.
- W2308573658 hasConcept C62611344 @default.
- W2308573658 hasConcept C66938386 @default.
- W2308573658 hasConcept C76155785 @default.
- W2308573658 hasConcept C77088390 @default.
- W2308573658 hasConcept C80444323 @default.
- W2308573658 hasConceptScore W2308573658C108037233 @default.
- W2308573658 hasConceptScore W2308573658C111919701 @default.
- W2308573658 hasConceptScore W2308573658C11413529 @default.
- W2308573658 hasConceptScore W2308573658C120314980 @default.
- W2308573658 hasConceptScore W2308573658C127413603 @default.
- W2308573658 hasConceptScore W2308573658C132525143 @default.
- W2308573658 hasConceptScore W2308573658C136764020 @default.
- W2308573658 hasConceptScore W2308573658C2779960059 @default.
- W2308573658 hasConceptScore W2308573658C34947359 @default.
- W2308573658 hasConceptScore W2308573658C36647736 @default.
- W2308573658 hasConceptScore W2308573658C41008148 @default.
- W2308573658 hasConceptScore W2308573658C45374587 @default.
- W2308573658 hasConceptScore W2308573658C48044578 @default.
- W2308573658 hasConceptScore W2308573658C555944384 @default.
- W2308573658 hasConceptScore W2308573658C62611344 @default.
- W2308573658 hasConceptScore W2308573658C66938386 @default.
- W2308573658 hasConceptScore W2308573658C76155785 @default.
- W2308573658 hasConceptScore W2308573658C77088390 @default.
- W2308573658 hasConceptScore W2308573658C80444323 @default.
- W2308573658 hasLocation W23085736581 @default.
- W2308573658 hasOpenAccess W2308573658 @default.
- W2308573658 hasPrimaryLocation W23085736581 @default.
- W2308573658 hasRelatedWork W2525206122 @default.
- W2308573658 hasRelatedWork W2596633751 @default.
- W2308573658 isParatext "false" @default.
- W2308573658 isRetracted "false" @default.
- W2308573658 magId "2308573658" @default.
- W2308573658 workType "article" @default.