Sciweavers

44 search results - page 7 / 9
» Just Enough Requirements Traceability
Sort
View
FPGA
2006
ACM
90views FPGA» more  FPGA 2006»
13 years 11 months ago
Improving performance and robustness of domain-specific CPLDs
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run-time reconfigurabil...
Mark Holland, Scott Hauck
HRI
2007
ACM
13 years 11 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy
ALT
2004
Springer
14 years 4 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber
MOBICOM
2004
ACM
14 years 1 months ago
Choosing beacon periods to improve response times for wireless HTTP clients
The IEEE 802.11 wireless LAN standard power-saving mode (PSM) allows the network interface card (NIC) to periodically sleep between receiving data. In this paper, we show that 802...
Suman Nath, Zachary R. Anderson, Srinivasan Seshan
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti