Sciweavers

5463 search results - page 245 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
IMC
2007
ACM
15 years 8 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
CIKM
2009
Springer
16 years 1 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 6 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
VTC
2007
IEEE
150views Communications» more  VTC 2007»
16 years 22 days ago
Effects of Non-Ideal Channel Feedback on Dual-Stream MIMO-OFDMA System Performance
— In this paper we analyze the downlink OFDMA system-level performances of a 2x2 dual-stream MIMO multiuser transmission scheme under the assumptions of partial and noisy channel...
István Z. Kovács, Klaus I. Pedersen,...
ICML
2007
IEEE
16 years 7 months ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi