Sciweavers

34170 search results - page 6827 / 6834
» Optimization
Sort
View
156
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 10 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
101
Voted
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
15 years 10 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
ICALP
2009
Springer
15 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
MOBISYS
2007
ACM
15 years 9 months ago
MobiSteer: using steerable beam directional antenna for vehicular network access
In this work, we investigate the use of directional antennas and beam steering techniques to improve performance of 802.11 links in the context of communication between a moving v...
Vishnu Navda, Anand Prabhu Subramanian, Kannan Dha...
CLUSTER
2009
IEEE
15 years 4 months ago
Combining I/O operations for multiple array variables in parallel netCDF
—Parallel netCDF (PnetCDF) is a popular library used in many scientific applications to store scientific datasets. It provides high-performance parallel I/O while maintaining ...
Kui Gao, Wei-keng Liao, Alok N. Choudhary, Robert ...
« Prev « First page 6827 / 6834 Last » Next »