Sciweavers

1347 search results - page 121 / 270
» On the Structure of the Minimum Time Function
Sort
View
ICALP
2010
Springer
15 years 8 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
146
Voted
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 21 days ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
IPPS
2008
IEEE
15 years 10 months ago
An adaptive parallel pipeline pattern for grids
This paper introduces an adaptive parallel pipeline pattern which follows the GRASP (Grid-Adaptive Structured Parallelism) methodology. GRASP is a generic methodology to incorpora...
Horacio González-Vélez, Murray Cole
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
15 years 8 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
SIAMJO
2010
155views more  SIAMJO 2010»
14 years 10 months ago
Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
Somayeh Moazeni, Thomas F. Coleman, Yuying Li