463 search results - page 51 / 93 » The Most Reliable Subgraph Problem |
WSC
2008
15 years 4 months ago
2008
One of the most important challenges for mining engineers is to correctly analyze and generate short-term planning schedules, or simply month mining plan. The objective is to demo...
100
click to vote
BMVC
2000
15 years 3 months ago
2000
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
110
click to vote
WDAG
1999
Springer
15 years 6 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
118
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
106
click to vote
ISSTA
2010
ACM
15 years 3 months ago
2010
ACM
In May 2009, Google conducted a company wide FindBugs “fixit”. Hundreds of engineers reviewed thousands of FindBugs warnings, and fixed or filed reports against many of the...