Sciweavers

1291 search results - page 188 / 259
» Arithmetic program paths
Sort
View
104
Voted
BMCBI
2005
158views more  BMCBI 2005»
15 years 18 days ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
114
Voted
CGO
2006
IEEE
15 years 6 months ago
Selecting Software Phase Markers with Code Structure Analysis
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Jeremy Lau, Erez Perelman, Brad Calder
91
Voted
ASPLOS
2012
ACM
13 years 8 months ago
Data races vs. data race bugs: telling the difference with portend
Even though most data races are harmless, the harmful ones are at the heart of some of the worst concurrency bugs. Alas, spotting just the harmful data races in programs is like ï...
Baris Kasikci, Cristian Zamfir, George Candea
ICIP
2003
IEEE
16 years 2 months ago
Near-optimal multipath streaming of H.264 using reference frame selection
New video codink standards such as H.264 offer the flexibility to select from a number of reference frames for motion-estimation for a given predicted frame. In this paper, we pro...
Gene Cheung
90
Voted
ICML
2003
IEEE
16 years 1 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi