Sciweavers

1452 search results - page 213 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
DAS
2006
Springer
15 years 4 months ago
Combining Multiple Classifiers for Faster Optical Character Recognition
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard
94
Voted
ASIAN
2007
Springer
102views Algorithms» more  ASIAN 2007»
15 years 7 months ago
A Static Birthmark of Binary Executables Based on API Call Structure
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
Seokwoo Choi, Heewan Park, Hyun-il Lim, Taisook Ha...
FPCA
1995
15 years 4 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
ALMOB
2006
106views more  ALMOB 2006»
15 years 26 days ago
Multiple sequence alignment with user-defined anchor points
Background: Automated software tools for multiple alignment often fail to produce biologically meaningful results. In such situations, expert knowledge can help to improve the qua...
Burkhard Morgenstern, Sonja J. Prohaska, Dirk P&ou...
111
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 1 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi