Sciweavers

1658 search results - page 11 / 332
» Learning Unknown Graphs
Sort
View
135
Voted
PREMI
2005
Springer
15 years 7 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
CORR
2008
Springer
173views Education» more  CORR 2008»
15 years 1 months ago
Decomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
Fangwen Fu, Mihaela van der Schaar
109
Voted
COLT
1995
Springer
15 years 5 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
130
Voted
IJRR
2008
92views more  IJRR 2008»
15 years 1 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
IJCNLP
2005
Springer
15 years 7 months ago
A Chunking Strategy Towards Unknown Word Detection in Chinese Word Segmentation
This paper proposes a chunking strategy to detect unknown words in Chinese word segmentation. First, a raw sentence is pre-segmented into a sequence of word atoms 1 using a maximum...
Guodong Zhou