787 search results - page 146 / 158 » Polynomial Constants are Decidable |
142
click to vote
SAC
2008
ACM
15 years 3 months ago
2008
ACM
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
157
click to vote
PVLDB
2010
15 years 2 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
151
click to vote
TCS
2010
15 years 2 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
137
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
This paper is concerned with decentralized estimation of a Gaussian source using multiple sensors. We consider a diversity scheme where only the sensor with the best channel sends...
139
click to vote
QEST
2010
IEEE
15 years 2 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...