Sciweavers

198 search results - page 17 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
COCOON
2008
Springer
14 years 12 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
91
Voted
JPDC
2006
104views more  JPDC 2006»
14 years 10 months ago
Performance analysis of different checkpointing and recovery schemes using stochastic model
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...
Partha Sarathi Mandal, Krishnendu Mukhopadhyaya
NIPS
2007
14 years 11 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
UAI
2004
14 years 11 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
CORR
2002
Springer
95views Education» more  CORR 2002»
14 years 10 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig