Sciweavers

656 search results - page 113 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
EMMCVPR
2011
Springer
13 years 11 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
CN
2008
98views more  CN 2008»
14 years 11 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
FOCS
2008
IEEE
15 years 5 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
STACS
2007
Springer
15 years 5 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
TCS
1998
14 years 11 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...