Sciweavers

3937 search results - page 215 / 788
» Questioning Ubiquitous Computing
Sort
View
182
Voted
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 6 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
CF
2004
ACM
15 years 9 months ago
BLOB computing
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
Frédéric Gruau, Yves Lhuillier, Phil...
AO
2007
80views more  AO 2007»
15 years 4 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner
CVPR
2009
IEEE
15 years 11 months ago
On bias correction for geometric parameter estimation in computer vision
Maximum likelihood (ML) estimation is widely used in many computer vision problems involving the estimation of geometric parameters, from conic fitting to bundle adjustment for s...
Takayuki Okatani, Koichiro Deguchi
IPPS
2007
IEEE
15 years 10 months ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...