• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 93
Next 10 →

RDF-3X: a risc-style engine for RDF

by Thomas Neumann , Gerhard Weikum - Proc. VLDB Endowment , 2008
"... ABSTRACT RDF is a data representation format for schema-free structured information that is gaining momentum in the context of Semantic-Web corpora, life sciences, and also Web 2.0 platforms. The "pay-as-you-go" nature of RDF and the flexible pattern-matching capabilities of its query lan ..."
Abstract - Cited by 149 (11 self) - Add to MetaCart
, and 3) a query optimizer for choosing optimal join orders using a cost model based on statistical synopses for entire join paths. The performance of RDF-3X, in comparison to the previously best state-of-the-art systems, has been measured on several large-scale datasets with more than 50 million RDF

SHIFTR: A Fast and Scalable System for Ad Hoc Sensemaking of Large Graphs

by Duen Horng Chau, Aniket Kittur, Hanghang Tong, Christos Faloutsos, Jason I. Hong
"... We present SHIFTR, a system that assists users in making sense of large scale graph data. Making sense of information represented as large graphs is a fundamental challenge in many data-intensive domains. We suggest the potential of strong synergies between the data mining, cognitive psychology, and ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
entities into multiple groups based on both positive and negative examples. SHIFTR scales linearly with the graph size through its fast algorithm, novel mList data structure, and externalization of graph meta data. We demonstrate SHIFTR’s usage and benefits through real-world sensemaking scenarios using

LIBRARIES The Design of A Fast and Flexible Internet Subscription System Using Content Graphs

by Joanna L. Kulik, David Clark, Arthur C. Smith, Joanna L. Ikulik
"... This dissertation describes the design and evaluation of the Fast, Flexible Forward-ing system (F3), a distributed system for disseminating information to networked subscribers. It examines existing subscription approaches, proposes F3 as an alter-native to these approaches, and presents results fro ..."
Abstract - Add to MetaCart
This dissertation describes the design and evaluation of the Fast, Flexible Forward-ing system (F3), a distributed system for disseminating information to networked subscribers. It examines existing subscription approaches, proposes F3 as an alter-native to these approaches, and presents results

A Simple and Fast Scheme for Code Compression for Embedded VLIW processors

by Prakash J, Eep C
"... under the guidance of Prof.Priti Shankar and Prof.Y.N Srikant Abstract Reducing program size is a desirable goal in the design of an embedded system since memory occupies a relatively large silicon area. In recent years, VLIW processors with a flexible instruction format have become important becaus ..."
Abstract - Add to MetaCart
under the guidance of Prof.Priti Shankar and Prof.Y.N Srikant Abstract Reducing program size is a desirable goal in the design of an embedded system since memory occupies a relatively large silicon area. In recent years, VLIW processors with a flexible instruction format have become important

Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs

by Adam Mclaughlin, David A. Bader
"... Abstract—The construction of efficient parallel graph al-gorithms is important for quickly solving problems in areas such as urban planning, social network analysis, and hardware verification. Existing GPU implementations of graph algorithms tend to be monolithic and thus contributions from the lite ..."
Abstract - Add to MetaCart
the literature are typically rebuilt rather than reused. Recent work has focused on traversal-based abstractions that efficiently execute a single breadth-first search or enact algorithms in the “think like a vertex ” paradigm. However, graph analytics such as the all-pairs shortest paths problem, diameter

Camp: fast and efficient IP lookup architecture

by Sailesh Kumar, Michela Becchi - in Proc. ANCS
"... A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been proposed, which delivers very high lookup and update throughput. These architectures often use a pipeline of embedded memories, ..."
Abstract - Cited by 28 (0 self) - Add to MetaCart
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been proposed, which delivers very high lookup and update throughput. These architectures often use a pipeline of embedded memories

Route Planning with Flexible Objective Functions

by Robert Geisberger , Moritz Kobitzsch , Peter Sanders - In Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX’10), 124–137. SIAM
"... Abstract We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy cost, on large scale road networks. The precomputation receives as input a directed graph, two edge weight fun ..."
Abstract - Cited by 10 (4 self) - Add to MetaCart
Abstract We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy cost, on large scale road networks. The precomputation receives as input a directed graph, two edge weight

Fast Brain Matching with Spectral Correspondence

by Herve Lombaert, Leo Grady, Jonathan R. Polimeni, Farida Cheriet
"... Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long computation times. Here we propose an approach based on spectral correspondence, where spectra of graphs derived from th ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
improve matching. Additional information, such as sulcal depth, surface curvature, and cortical thickness can be represented in a flexible way into graph node weights (rather than only into graph edge weights) and as extra embedded coordinates. In control experiments, cortex matching becomes almost

StarT-Voyager: A Flexible Platform for Exploring Scalable SMP Issues

by Boon S. Ang, Derek Chiou, Daniel L. Rosenband, Mike Ehrlich, Larry Rudolph - In Conference Proceedings of Supercomputing 98 , 1998
"... : This paper describes StarT-Voyager, a machine designed as an experimental platform for research in cluster system communication. The heart of StarT-Voyager is a network interface unit (NIU) that connects the memory bus of a PowerPC-based SMP to the MIT Arctic network. The NIU is highly flexible, ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
, with its set of functions easily modified by firmware or by programmable hardware, making it possible to compare different communication interfaces and implementation strategies on a common platform. Its flexibility comes from a fast embedded processor and large, fast FPGAs that surround a high

1Supervised Hashing Using Graph Cuts and Boosted Decision Trees

by Guosheng Lin, Chunhua Shen, Anton Van Den Hengel
"... Abstract—Embedding image features into a binary Hamming space can improve both the speed and accuracy of large-scale query-by-example image retrieval systems. Supervised hashing aims to map the original features to compact binary codes in a manner which preserves the label-based similarities of the ..."
Abstract - Add to MetaCart
Abstract—Embedding image features into a binary Hamming space can improve both the speed and accuracy of large-scale query-by-example image retrieval systems. Supervised hashing aims to map the original features to compact binary codes in a manner which preserves the label-based similarities
Next 10 →
Results 1 - 10 of 93
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University