Sciweavers

1149 search results - page 180 / 230
» Minimally non-Pfaffian graphs
Sort
View
JEA
2008
88views more  JEA 2008»
14 years 12 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
TOG
2008
137views more  TOG 2008»
14 years 11 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...
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
14 years 9 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 3 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 2 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...