Sciweavers

420 search results - page 21 / 84
» Search on High Degree Graphs
Sort
View
106
Voted
ESWS
2010
Springer
15 years 5 months ago
Facet Graphs: Complex Semantic Querying Made Easy
While the Semantic Web is rapidly filling up, appropriate tools for searching it are still at infancy. In this paper we describe an approach that allows humans to access informatio...
Philipp Heim, Thomas Ertl, Jürgen Ziegler
APAL
2005
93views more  APAL 2005»
15 years 17 days ago
Logical aspects of Cayley-graphs: the group case
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
Dietrich Kuske, Markus Lohrey
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 21 days ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
IEEEAMS
2003
IEEE
15 years 6 months ago
Rich and Scalable Peer-to-Peer Search with SHARK
SHARK is a novel concept and middleware service for search in peer-to-peer (P2P) networks. Rather than flooding a network like Gnutella or imposing numerical IDs on objects like d...
Jan Mischke, Burkhard Stiller
100
Voted
WABI
2004
Springer
15 years 6 months ago
Local Search Heuristic for Rigid Protein Docking
Abstract. We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and...
Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunne...