720 search results - page 46 / 144 » A Weighting Scheme for Star-Graphs |
121
click to vote
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
130
click to vote
IMCSIT
2010
14 years 10 months ago
2010
Word Sense Disambiguation in text is still a difficult problem as the best supervised methods require laborious and costly manual preparation of training data. Thus, this work focu...
108
Voted
PODC
2006
ACM
15 years 6 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
93
Voted
CHES
2005
Springer
15 years 6 months ago
2005
Springer
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
112
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...