Sciweavers

4865 search results - page 772 / 973
» The Complexity of Graph Connectivity
Sort
View
CSUR
1999
159views more  CSUR 1999»
15 years 3 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
190
Voted
VLDB
2002
ACM
264views Database» more  VLDB 2002»
15 years 3 months ago
Viator - A Tool Family for Graphical Networking and Data View Creation
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
Stephan Heymann, Katja Tham, Axel Kilian, Gunnar W...
VEE
2012
ACM
255views Virtualization» more  VEE 2012»
13 years 11 months ago
Adding dynamically-typed language support to a statically-typed language compiler: performance evaluation, analysis, and tradeof
Applications written in dynamically typed scripting languages are increasingly popular for Web software development. Even on the server side, programmers are using dynamically typ...
Kazuaki Ishizaki, Takeshi Ogasawara, José G...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 4 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
146
Voted
ICALP
2007
Springer
15 years 10 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson