Sciweavers

2226 search results - page 409 / 446
» Computable Analysis via Representations
Sort
View
ACL
2009
14 years 11 months ago
Sentence diagram generation using dependency parsing
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
Elijah Mayfield
VIS
2005
IEEE
109views Visualization» more  VIS 2005»
16 years 3 months ago
Topological Structures of 3D Tensor Fields
Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that d...
Xiaoqiang Zheng, Beresford N. Parlett, Alex Pang
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
16 years 2 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
15 years 11 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
LPAR
2001
Springer
15 years 6 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...