515 search results - page 87 / 103 » Classroom Examples of Robustness Problems in Geometric Compu... |
127
click to vote
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
106
click to vote
DAC
2005
ACM
15 years 10 months ago
2005
ACM
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...
MOBICOM
2009
ACM
15 years 4 months ago
2009
ACM
This paper presents the design challenges posed by a new class of ultra-low-power devices referred to as Energy-Harvesting Active Networked Tags (EnHANTs). EnHANTs are small, fle...
JCDL
2006
ACM
15 years 3 months ago
2006
ACM
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Just as POMDPs have been used to reason explicitly about uncertainty in single-agent systems, there has been recent interest in using multi-agent POMDPs to coordinate teams of age...