Sciweavers

1368 search results - page 261 / 274
» Generalized Rook Polynomials
Sort
View
FSTTCS
2006
Springer
13 years 10 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
CGO
2003
IEEE
13 years 10 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
13 years 10 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
DEXA
1995
Springer
126views Database» more  DEXA 1995»
13 years 10 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
FOCS
1995
IEEE
13 years 10 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan