Sciweavers

5169 search results - page 947 / 1034
» Locality approximation using time
Sort
View
152
Voted
BMCBI
2005
151views more  BMCBI 2005»
15 years 3 months ago
ProMiner: rule-based protein and gene entity recognition
Background: Identification of gene and protein names in biomedical text is a challenging task as the corresponding nomenclature has evolved over time. This has led to multiple syn...
Daniel Hanisch, Katrin Fundel, Heinz-Theodor Mevis...
CGF
1998
118views more  CGF 1998»
15 years 3 months ago
An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
Nicolas Holzschuch, François X. Sillion
ATMOS
2010
183views Optimization» more  ATMOS 2010»
15 years 2 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
RTAS
2011
IEEE
14 years 7 months ago
Virtual-CPU Scheduling in the Quest Operating System
This paper describes the scheduling framework for a new operating system called “Quest”. The three main goals of Quest are to ensure safety, predictability and efficiency of ...
Matthew Danish, Ye Li, Richard West
133
Voted
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 3 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans