Sciweavers

2600 search results - page 430 / 520
» Clustering with or without the Approximation
Sort
View
ALMOB
2008
92views more  ALMOB 2008»
13 years 9 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 9 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
JSAC
2006
105views more  JSAC 2006»
13 years 9 months ago
Network Topology Inference Based on End-to-End Measurements
Abstract--We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given hosts in an a...
Xing Jin, Wai-Pun Ken Yiu, S.-H. Gary Chan, Yajun ...
SIGIR
2008
ACM
13 years 9 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
JSAC
2007
133views more  JSAC 2007»
13 years 9 months ago
On broadcasting with cooperative diversity in multi-hop wireless networks
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...