515 search results - page 87 / 103 » Classroom Examples of Robustness Problems in Geometric Compu... |
178
click to vote
RECOMB
2001
Springer
16 years 1 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...
140
click to vote
DAC
2005
ACM
16 years 2 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 ...
104
click to vote
MOBICOM
2009
ACM
15 years 8 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...
135
click to vote
JCDL
2006
ACM
15 years 7 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...
119
click to vote
ATAL
2005
Springer
15 years 7 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...