Sciweavers

1008 search results - page 75 / 202
» Minimizing Average Flow-Time
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 10 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
INFOCOM
2005
IEEE
14 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
IPMI
2005
Springer
14 years 3 months ago
Transitive Inverse-Consistent Manifold Registration
Abstract. This paper presents a new registration method called Transitive InverseConsistent Manifold Registration (TICMR). The TICMR method jointly estimates correspondence maps be...
Xiujuan Geng, Dinesh Kumar, Gary E. Christensen
ICDE
2009
IEEE
200views Database» more  ICDE 2009»
14 years 11 months ago
Adaptive Scheduling of Web Transactions
In highly interactive dynamic web database systems, user satisfaction determines their success. In such systems, userrequested web pages are dynamically created by executing a numb...
Shenoda Guirguis, Mohamed A. Sharaf, Panos K. Chry...
ICCAD
2004
IEEE
180views Hardware» more  ICCAD 2004»
14 years 6 months ago
Physical placement driven by sequential timing analysis
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
Aaron P. Hurst, Philip Chong, Andreas Kuehlmann