3937 search results - page 386 / 788 » Questioning Ubiquitous Computing |
153
click to vote
NDJFL
1998
15 years 6 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
211
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
172
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
180
Voted
CSCWD
2001
Springer
15 years 11 months ago
2001
Springer
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
164
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Although many color constancy methods exist, they are all based on specific assumptions such as the set of possible light sources, or the spatial and spectral characteristics of i...