Sciweavers

301 search results - page 43 / 61
» The k-Median Problem for Directed Trees
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
IPPS
2002
IEEE
14 years 13 days ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
AAAI
2010
13 years 9 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
DDEP
2000
Springer
13 years 12 months ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
Integrating protein structures and precomputed genealogies in the Magnum database: Examples with cellular retinoid binding prote
Background: When accurate models for the divergent evolution of protein sequences are integrated with complementary biological information, such as folded protein structures, anal...
Michael E. Bradley, Steven A. Benner