Sciweavers

3250 search results - page 315 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CGF
2010
99views more  CGF 2010»
15 years 6 months ago
Trivial Connections on Discrete Surfaces
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Keenan Crane, Mathieu Desbrun, Peter Schröder
ICALP
2009
Springer
16 years 1 months ago
Assigning Papers to Referees
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
Kurt Mehlhorn
AICCSA
2006
IEEE
86views Hardware» more  AICCSA 2006»
16 years 22 days ago
On the Optimal Deployment of Heterogeneous Sensing Devices
The problem of optimally deploying a heterogeneous set of sensing devices in environments with differential surveillance requirements is presented. The problem is formulated in th...
Rabie Ramadan, Khaled Abdelghany, Hesham El-Rewini
UAI
2008
15 years 8 months ago
Discovering Cyclic Causal Models by Independent Components Analysis
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
Gustavo Lacerda, Peter Spirtes, Joseph Ramsey, Pat...
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
16 years 1 months ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...