Sciweavers

900 search results - page 144 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
BMCBI
2006
111views more  BMCBI 2006»
13 years 8 months ago
High throughput profile-profile based fold recognition for the entire human proteome
Background: In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold r...
Liam J. McGuffin, Richard T. Smith, Kevin Bryson, ...
IPOM
2007
Springer
14 years 2 months ago
Measurement and Analysis of Intraflow Performance Characteristics of Wireless Traffic
It is by now widely accepted that the arrival process of aggregate network traffic exhibits self-similar characteristics which result in the preservation of traffic burstiness (hig...
Dimitrios P. Pezaros, Manolis Sifalakis, David Hut...
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
14 years 10 months ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina
ICML
2006
IEEE
14 years 9 months ago
Learning hierarchical task networks by observation
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
Negin Nejati, Pat Langley, Tolga Könik
ARC
2007
Springer
102views Hardware» more  ARC 2007»
14 years 20 days ago
Reconfigurable Hardware Acceleration of Canonical Graph Labelling
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
David B. Thomas, Wayne Luk, Michael Stumpf