Sciweavers

2125 search results - page 291 / 425
» On Graph Complexity
Sort
View
106
Voted
GLOBECOM
2007
IEEE
15 years 4 months ago
On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
Ashutosh Deepak Gore, Abhay Karandikar, Srikanth J...
SIPS
2007
IEEE
15 years 4 months ago
An Area-Efficient FPGA-Based Architecture for Fully-Parallel Stochastic LDPC Decoding
Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding...
Saeed Sharifi Tehrani, Shie Mannor, Warren J. Gros...
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 4 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
CPAIOR
2007
Springer
15 years 4 months ago
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Marie-Claude Côté, Bernard Gendron, L...
102
Voted
ICALP
2007
Springer
15 years 4 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz