Sciweavers

1110 search results - page 128 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
CHI
2009
ACM
16 years 4 months ago
Two studies of opportunistic programming: interleaving web foraging, learning, and writing code
This paper investigates the role of online resources in problem solving. We look specifically at how programmers--an exemplar form of knowledge workers--opportunistically interlea...
Joel Brandt, Philip J. Guo, Joel Lewenstein, Mira ...
3DPVT
2006
IEEE
155views Visualization» more  3DPVT 2006»
15 years 10 months ago
The Reverse Projection Correlation Principle for Depth from Defocus
In this paper, we address the problem of finding depth from defocus in a fundamentally new way. Most previous methods have used an approximate model in which blurring is shift in...
Scott McCloskey, Michael S. Langer, Kaleem Siddiqi
VEE
2012
ACM
322views Virtualization» more  VEE 2012»
13 years 12 months ago
Modeling virtualized applications using machine learning techniques
With the growing adoption of virtualized datacenters and cloud hosting services, the allocation and sizing of resources such as CPU, memory, and I/O bandwidth for virtual machines...
Sajib Kundu, Raju Rangaswami, Ajay Gulati, Ming Zh...
ICDCIT
2005
Springer
15 years 9 months ago
Merging Clustering Algorithms in Mobile Ad Hoc Networks
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...