Sciweavers

794 search results - page 110 / 159
» Improved algorithms for orienteering and related problems
Sort
View
PPOPP
1993
ACM
13 years 11 months ago
Experience with Fine-Grain Synchronization in MIMD Machines for Preconditioned Conjugate Gradient
This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. This algorithm represents a large class of algo...
Donald Yeung, Anant Agarwal
CONEXT
2008
ACM
13 years 9 months ago
Maintaining replicas in unstructured P2P systems
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...
Christof Leng, Wesley W. Terpstra, Bettina Kemme, ...
JAIR
2007
95views more  JAIR 2007»
13 years 7 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 2 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
SIGIR
2006
ACM
14 years 1 months ago
Thread detection in dynamic text message streams
Text message stream is a newly emerging type of Web data which is produced in enormous quantities with the popularity of Instant Messaging and Internet Relay Chat. It is benefici...
Dou Shen, Qiang Yang, Jian-Tao Sun, Zheng Chen