Sciweavers

526 search results - page 49 / 106
» On the Number of Minimal Addition Chains
Sort
View
DAM
2008
88views more  DAM 2008»
14 years 10 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
DKE
2007
101views more  DKE 2007»
14 years 9 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
TOG
2008
137views more  TOG 2008»
14 years 9 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
CAL
2004
14 years 9 months ago
An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...
María Engracia Gómez, José Du...
SIAMCO
2002
81views more  SIAMCO 2002»
14 years 9 months ago
Robust Controller Synthesis for Uncertain Time-Varying Systems
In this paper we develop and present new convex synthesis conditions for robust performance in linear time-varying systems, subject to time-varying perturbations. In particular, th...
Carol Pirie, Geir E. Dullerud