Sciweavers

11211 search results - page 198 / 2243
» Rank-Sensitive Data Structures
Sort
View
CIKM
2008
Springer
15 years 5 months ago
Structural relevance: a common basis for the evaluation of structured document retrieval
This paper presents a unified framework for the evaluation of a range of structured document retrieval (SDR) approaches and tasks. The framework is based on a model of tree retrie...
Mir Sadek Ali, Mariano P. Consens, Gabriella Kazai...
CVPR
2012
IEEE
13 years 5 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
IKE
2010
15 years 27 days ago
Active Datawarehouse Loading by Tool Based ETL Procedure
: Over the years, DataWarehousing has gone through a number of evolutions from a relatively simple reporting database to sophisticated analytical applications such as analyzing cus...
Mallikharjuna Reddy V, Sanjay K. Jena
IV
2010
IEEE
193views Visualization» more  IV 2010»
15 years 1 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka

Book
393views
17 years 26 days ago
Computational Modeling and Complexity Science
"This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science"
Allen B. Downey