Sciweavers

1951 search results - page 371 / 391
» An algorithm for improving graph partitions
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 10 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
SIGIR
2008
ACM
14 years 10 months ago
Classifiers without borders: incorporating fielded text from neighboring web pages
Accurate web page classification often depends crucially on information gained from neighboring pages in the local web graph. Prior work has exploited the class labels of nearby p...
Xiaoguang Qi, Brian D. Davison
CN
2004
114views more  CN 2004»
14 years 9 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
INFOCOM
2010
IEEE
14 years 8 months ago
Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization
—Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in ...
Lirong Jian, Zheng Yang, Yunhao Liu
ACL
2010
14 years 8 months ago
Structural Semantic Relatedness: A Knowledge-Based Method to Named Entity Disambiguation
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
Xianpei Han, Jun Zhao