Sciweavers

969 search results - page 71 / 194
» Generalized matching from theory to application
Sort
View
SIGCOMM
2010
ACM
13 years 9 months ago
A mobile peer-to-peer system for opportunistic content-centric networking
In this work we present a middleware architecture for a mobile peer-to-peer content distribution system. Our architecture allows wireless content dissemination between mobile node...
Ólafur Ragnar Helgason, Emre A. Yavuz, Sylv...
CVIU
2011
13 years 23 days ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 4 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
ENTCS
2002
128views more  ENTCS 2002»
13 years 9 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
NIPS
2007
13 years 10 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh