Sciweavers

160 search results - page 23 / 32
» Equivalence between Schedule Representations: Theory and App...
Sort
View
FCT
2003
Springer
14 years 26 days ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
IANDC
2010
141views more  IANDC 2010»
13 years 6 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
14 years 1 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 8 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
AAAI
2006
13 years 9 months ago
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming
In recent years there has been a great deal of interest in "modular reinforcement learning" (MRL). Typically, problems are decomposed into concurrent subgoals, allowing ...
Sooraj Bhat, Charles Lee Isbell Jr., Michael Matea...