1813 search results - page 161 / 363 » Instance Pruning Techniques |
180
click to vote
CONEXT
2009
ACM
15 years 7 months ago
2009
ACM
Software bugs in routers lead to network outages, security vulnerabilities, and other unexpected behavior. Rather than simply crashing the router, bugs can violate protocol semant...
175
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
188
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
312
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
298
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...