Sciweavers

814 search results - page 112 / 163
» Machine Translation by Case Generalization
Sort
View
108
Voted
FORMATS
2006
Springer
15 years 7 months ago
Matching Scenarios with Timing Constraints
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are "consistent&qu...
Prakash Chandrasekaran, Madhavan Mukund
HYBRID
2000
Springer
15 years 7 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
KDD
1995
ACM
139views Data Mining» more  KDD 1995»
15 years 7 months ago
Extracting Support Data for a Given Task
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vec...
Bernhard Schölkopf, Chris Burges, Vladimir Va...
122
Voted
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 4 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
123
Voted
FLAIRS
2004
15 years 4 months ago
Simulating Biological Motion Perception Using a Recurrent Neural Network
People have the ability to perceive biological motion under conditions of severely limited visual information. If the information is in the form of a point-light motion sequence o...
Roxanne L. Canosa