Sciweavers

4565 search results - page 514 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
ICML
2005
IEEE
16 years 4 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
15 years 10 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
ASPDAC
2004
ACM
83views Hardware» more  ASPDAC 2004»
15 years 9 months ago
Instruction set and functional unit synthesis for SIMD processor cores
—This paper focuses on SIMD processor synthesis and proposes a SIMD instruction set/functional unit synthesis algorithm. Given an initial assembly code and a timing constraint, t...
Nozomu Togawa, Koichi Tachikake, Yuichiro Miyaoka,...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 8 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
AIPS
2006
15 years 5 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir