Sciweavers

8125 search results - page 1589 / 1625
» Parallelism and evolutionary algorithms
Sort
View
JCB
1998
129views more  JCB 1998»
13 years 9 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
PAMI
1998
116views more  PAMI 1998»
13 years 9 months ago
Scale-Space Derived From B-Splines
—It is well-known that the linear scale-space theory in computer vision is mainly based on the Gaussian kernel. The purpose of the paper is to propose a scale-space theory based ...
Yu-Ping Wang, Seng Luan Lee
VLSISP
2002
112views more  VLSISP 2002»
13 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
MT
2007
158views more  MT 2007»
13 years 9 months ago
Automatic extraction of translations from web-based bilingual materials
This paper describes the framework of the StatCan Daily Translation Extraction System (SDTES), a computer system that maps and compares webbased translation texts of Statistics Can...
Qibo Zhu, Diana Zaiu Inkpen, Ash Asudeh
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
« Prev « First page 1589 / 1625 Last » Next »