Sciweavers

1220 search results - page 200 / 244
» Restricting grammatical complexity
Sort
View
TIT
2011
131views more  TIT 2011»
13 years 3 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
TVCG
2011
126views more  TVCG 2011»
13 years 3 months ago
A Comparison of Gradient Estimation Methods for Volume Rendering on Unstructured Meshes
—This paper presents a study of gradient estimation methods for rendering unstructured-mesh volume data. Gradient estimation is necessary for rendering shaded isosurfaces and spe...
Carlos D. Correa, Robert Hero, Kwan-Liu Ma
EM
2010
154views Management» more  EM 2010»
13 years 2 months ago
Higher-Weight Heegner Points
In this paper we formulate a conjecture which partially generalizes the Gross-Kohnen-Zagier theorem to higher weight modular forms. For f S2k(N) satisfying certain conditions, we c...
Kimberly Hopkins
PVLDB
2010
111views more  PVLDB 2010»
13 years 2 months ago
PolicyReplay: Misconfiguration-Response Queries for Data Breach Reporting
Recent legislation has increased the requirements of organizations to report data breaches, or unauthorized access to data. While access control policies are used to restrict acce...
Daniel Fabbri, Kristen LeFevre, Qiang Zhu
TII
2010
146views Education» more  TII 2010»
13 years 2 months ago
A Flexible Design Flow for Software IP Binding in FPGA
Software intellectual property (SWIP) is a critical component of increasingly complex field programmable gate arrays (FPGA)-based system-on-chip (SOC) designs. As a result, develop...
Michael A. Gora, Abhranil Maiti, Patrick Schaumont