Sciweavers

792 search results - page 16 / 159
» Constrained Ramsey Numbers
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
JACM
2010
116views more  JACM 2010»
13 years 5 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
JGAA
2010
128views more  JGAA 2010»
13 years 5 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
CIKM
2006
Springer
13 years 11 months ago
Constrained subspace skyline computation
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...
Evangelos Dellis, Akrivi Vlachou, Ilya Vladimirski...
PAIRING
2010
Springer
155views Cryptology» more  PAIRING 2010»
13 years 5 months ago
Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
Brian J. Matt