Sciweavers

9842 search results - page 1570 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
OOPSLA
2010
Springer
15 years 5 months ago
The Spoofax language workbench
Domain-specific languages offer high expressive power foa particular problem domain, abstracting over the accidental complexity associated with traditional software development. ...
Lennart C. L. Kats, Eelco Visser
TC
2010
15 years 5 months ago
Scalable Node-Level Computation Kernels for Parallel Exact Inference
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
Yinglong Xia, Viktor K. Prasanna
TMC
2010
130views more  TMC 2010»
15 years 5 months ago
SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes
—This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative ackn...
Michele Rossi, Nicola Bui, Giovanni Zanca, Luca St...
TPDS
2010
87views more  TPDS 2010»
15 years 5 months ago
An ISP-Friendly File Distribution Protocol: Analysis, Design, and Implementation
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
Minghong Lin, John C. S. Lui, Dah-Ming Chiu
BIBM
2010
IEEE
286views Bioinformatics» more  BIBM 2010»
15 years 4 months ago
Evaluation of short read metagenomic assembly
Advances in sequencing technologies have equipped researchers with the ability to sequence the collective genome of entire microbial communities commonly referred to as metagenomi...
Anveshi Charuvaka, Huzefa Rangwala
« Prev « First page 1570 / 1969 Last » Next »