位置：成果数据库 > 会议 > 会议详情页
On the communication complexity of linear algebraic problems in the message passing model
  • 所属机构名称：中国科学院计算技术研究所
  • 会议名称：28th International Symposium on Distributed Computing, DISC 2014
  • 时间：2014
  • 成果类型：会议
  • 相关项目：数据流模型与判定树模型中的几个问题研究
同会议论文项目
数据流模型与判定树模型中的几个问题研究
期刊论文 17 会议论文 69
同项目会议论文
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Learning Market Parameters using Aggregate Demand Queries
How to select the top k elements from evolving data?
How to select the top k elements from evolving data?
How to select the top k elements from evolving data?
On the power of parity queries in boolean decision trees
Space-efficient approximation scheme for circular earth mover distance
Streaming and Communication Complexity of Clique Approximation
Stam's conjecture and threshold phenomena in collision resistance
The relationship between inner product and counting cycles
How to select the top k elements from evolving data?
On the communication complexity of linear algebraic problems in the message passing model
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
The least-core and nucleolus of path cooperative games
The least-core and nucleolus of path cooperative games
The least-core and nucleolus of path cooperative games
The least-core and nucleolus of path cooperative games
On the power of parity queries in boolean decision trees
On the power of parity queries in boolean decision trees
Minimizing seed set selection with probabilistic coverage guarantee in a social network
Minimizing seed set selection with probabilistic coverage guarantee in a social network
On the communication complexity of linear algebraic problems in the message passing model
Tighter relations between sensitivity and other complexity measures
Tighter relations between sensitivity and other complexity measures
Determinantal Complexities and Field Extensions
Determinantal Complexities and Field Extensions
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Influence Maximization in Dynamic Social Networks
Influence Maximization in Dynamic Social Networks
Tight Bounds for Graph Problems in Insertion Streams
On the power of parity queries in boolean decision trees
Minimizing seed set selection with probabilistic coverage guarantee in a social network
Minimizing seed set selection with probabilistic coverage guarantee in a social network
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
On the communication complexity of linear algebraic problems in the message passing model
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
Tighter relations between sensitivity and other complexity measures
Tighter relations between sensitivity and other complexity measures
Space-bounded communication complexity
Space-bounded communication complexity
Space-bounded communication complexity
Space-bounded communication complexity
Determinantal Complexities and Field Extensions
Determinantal Complexities and Field Extensions
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Optimal Pricing for Improving Efficiency of Taxi Systems
Optimal Pricing for Improving Efficiency of Taxi Systems
Optimal Pricing for Improving Efficiency of Taxi Systems
Optimal Pricing for Improving Efficiency of Taxi Systems
Influence Maximization in Dynamic Social Networks
Influence Maximization in Dynamic Social Networks
Learning Market Parameters using Aggregate Demand Queries
Learning Market Parameters using Aggregate Demand Queries
Learning Market Parameters using Aggregate Demand Queries
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol