182 search results - page 26 / 37 » Extremal Problems For Transversals In Graphs With Bounded De... |
119
click to vote
PODS
2005
ACM
16 years 1 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
115
Voted
SOFSEM
2007
Springer
15 years 7 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
104
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
SIROCCO
2008
15 years 3 months ago
2008
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
114
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...