Sciweavers

8728 search results - page 79 / 1746
» On Reduct Construction Algorithms
Sort
View
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
EMNLP
2006
13 years 10 months ago
Learning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
Michael L. Wick, Aron Culotta, Andrew McCallum
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
13 years 9 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting
PAMI
2006
127views more  PAMI 2006»
13 years 9 months ago
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
Understanding the structure of multidimensional patterns, especially in unsupervised case, is of fundamental importance in data mining, pattern recognition and machine learning. Se...
Martin H. C. Law, Anil K. Jain
ICONIP
2004
13 years 10 months ago
Non-linear Dimensionality Reduction by Locally Linear Isomaps
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...
Ashutosh Saxena, Abhinav Gupta, Amitabha Mukerjee