Sciweavers

2004 search results - page 214 / 401
» Sampling from large graphs
Sort
View
134
Voted
TMI
2010
206views more  TMI 2010»
14 years 10 months ago
Random Subspace Ensembles for fMRI Classification
Classification of brain images obtained through functional magnetic resonance imaging (fMRI) poses a serious challenge to pattern recognition and machine learning due to the extrem...
Ludmila I. Kuncheva, Juan José Rodrí...
339
Voted
ICDAR
2011
IEEE
14 years 3 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
IWPC
2002
IEEE
15 years 8 months ago
Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information
When we try to debug or to comprehend a large program, it is important to separate suspicious program portions from the overall source program. Program slicing is a promising tech...
Tomonori Takada, Fumiaki Ohata, Katsuro Inoue
133
Voted
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 7 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
ICRA
2007
IEEE
146views Robotics» more  ICRA 2007»
15 years 10 months ago
Crowds of Moving Objects: Navigation Planning and Simulation
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
Julien Pettré, Helena Grillon, Daniel Thalm...