Sciweavers

4208 search results - page 654 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
WOSP
1998
ACM
15 years 6 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
MOBISYS
2009
ACM
16 years 2 months ago
Point&Connect: intention-based device pairing for mobile phone users
Point&Connect (P&C) offers an intuitive and resilient device pairing solution on standard mobile phones. Its operation follows the simple sequence of point-and-connect: wh...
Chunyi Peng, Guobin Shen, Yongguang Zhang, Songwu ...
125
Voted
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 8 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
MOBICOM
2009
ACM
15 years 8 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 7 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin