Sciweavers

535 search results - page 81 / 107
» Generalized Version Space Trees
Sort
View
128
Voted
SAC
2004
ACM
15 years 7 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
113
Voted
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
15 years 1 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
137
Voted
RSA
2010
94views more  RSA 2010»
15 years 6 days ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
VIS
2009
IEEE
211views Visualization» more  VIS 2009»
16 years 3 months ago
Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....
Cong Wang, Yi-Jen Chiang
119
Voted
ADAEUROPE
2003
Springer
15 years 7 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney