Sciweavers

1629 search results - page 171 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
IPPS
2000
IEEE
15 years 3 months ago
Parallel Information Retrieval on an SCI-Based PC-NOW
This paper presents an efficient parallel information retrieval (IR) system which provides fast information service for the Internet users on lowcost high-performance PC-NOW enviro...
Sang-Hwa Chung, Hyuk-Chul Kwon, Kwang Ryel Ryu, Ha...
NCA
2007
IEEE
15 years 5 months ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
ICML
2003
IEEE
15 years 11 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
ICML
2006
IEEE
15 years 11 months ago
Multiclass boosting with repartitioning
A multiclass classification problem can be reduced to a collection of binary problems with the aid of a coding matrix. The quality of the final solution, which is an ensemble of b...
Ling Li
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 11 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky