Sciweavers

1096 search results - page 89 / 220
» Evaluating Algorithms for Concept Description
Sort
View
FPL
2001
Springer
101views Hardware» more  FPL 2001»
14 years 1 months ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
ICPR
2006
IEEE
14 years 10 months ago
A Ground Truth Correspondence Measure for Benchmarking
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
CRV
2005
IEEE
198views Robotics» more  CRV 2005»
14 years 2 months ago
Analysis of Player Actions in Selected Hockey Game Situations
We present a proof of concept system to represent and reason about hockey play. The system takes as input player motion trajectory data tracked from game video and supported by kn...
Fahong Li, Robert J. Woodham
AIPR
2007
IEEE
14 years 3 months ago
Using a High-Fidelity Simulation Framework for Performance Singularity
A common way to evaluate the performance of a system is to compare the algorithmic outputs with ground truth to identify divergences in the system’s performance and discover the...
Chris Scrapper, Raj Madhavan, Stephen Balakirsky
APWEB
2010
Springer
14 years 6 days ago
Learning to Find Interesting Connections in Wikipedia
To help users answer the question, what is the relation between (real world) entities or concepts, we might need to go well beyond the borders of traditional information retrieval ...
Marek Ciglan, Etienne Riviere, Kjetil Nørv&...