Sciweavers

2109 search results - page 280 / 422
» Solving Necklace Constraint Problems
Sort
View
INFOCOM
2010
IEEE
15 years 2 months ago
Distributed Dynamic Speed Scaling
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Rade Stanojevic, Robert Shorten
MASS
2010
119views Communications» more  MASS 2010»
15 years 2 months ago
Energy-efficient data redistribution in sensor networks
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...
Bin Tang, Neeraj Jaggi, Haijie Wu, Rohini Kurkal
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 7 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
148
Voted
IJCV
2006
94views more  IJCV 2006»
15 years 5 months ago
Four Points in Two or Three Calibrated Views: Theory and Practice
Suppose two perspective views of four world points are given and that the intrinsic parameters are known but the camera poses and the world point positions are not. We prove that t...
David Nistér, Frederik Schaffalitzky
SIAMJO
2010
87views more  SIAMJO 2010»
15 years 3 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson