1538 search results - page 192 / 308 » Spectral Techniques in Graph Algorithms |
133
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
110
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
141
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
152
click to vote
ERSHOV
2009
Springer
15 years 5 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
133
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...