Sciweavers

1040 search results - page 173 / 208
» Rounding algorithms for covering problems
Sort
View
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
13 years 5 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
ICMCS
2010
IEEE
215views Multimedia» more  ICMCS 2010»
14 years 9 months ago
Efficient search of Top-K video subvolumes for multi-instance action detection
Action detection was formulated as a subvolume mutual information maximization problem in [8], where each subvolume identifies where and when the action occurs in the video. Desp...
Norberto A. Goussies, Zicheng Liu, Junsong Yuan
87
Voted
BMCBI
2006
137views more  BMCBI 2006»
14 years 9 months ago
A classification-based framework for predicting and analyzing gene regulatory response
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
Anshul Kundaje, Manuel Middendorf, Mihir Shah, Chr...
WWW
2001
ACM
15 years 10 months ago
Efficient Acquisition of Web Data through Restricted Query Interfaces
A wealth of information is available on the Web. But often, such data are hidden behind form interfaces which allow only a restrictive set of queries over the underlying databases...
Cláudio T. Silva, Juliana Freire, Simon Bye...
ICC
2007
IEEE
102views Communications» more  ICC 2007»
15 years 4 months ago
Maximizing Angle Coverage in Visual Sensor Networks
— In this paper, we study the angle coverage problem in visual sensor networks where all sensors are equipped with cameras. An object of interest moves around the network and the...
Kit-Yee Chow, King-Shan Lui, Edmund Y. Lam