Sciweavers

104 search results - page 10 / 21
» An Improved Random Neighborhood Graph Approach
Sort
View
JCT
2007
117views more  JCT 2007»
14 years 9 months ago
Large independent sets in regular graphs of large girth
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
Joseph Lauer, Nicholas C. Wormald
ICASSP
2011
IEEE
14 years 1 months ago
Improved spoken term detection with graph-based re-ranking in feature space
This paper presents a graph-based approach for spoken term detection. Each first-pass retrieved utterance is a node on a graph and the edge between two nodes is weighted by the s...
Yun-Nung Chen, Chia-Ping Chen, Hung-yi Lee, Chun-a...
ASUNAM
2010
IEEE
14 years 11 months ago
A Unified Framework for Link Recommendation Using Random Walks
The phenomenal success of social networking sites, such as Facebook, Twitter and LinkedIn, has revolutionized the way people communicate. This paradigm has attracted the attention ...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
AAAI
1994
14 years 11 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
SASN
2004
ACM
15 years 3 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim