Sciweavers

419 search results - page 70 / 84
» Constraint models for graceful graphs
Sort
View
CVPR
2010
IEEE
14 years 2 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
JWSR
2007
106views more  JWSR 2007»
13 years 6 months ago
Architecture-Driven Service Discovery for Service Centric Systems
: Service discovery has been recognised as an important aspect in the development of service centric systems, i.e., software systems which deploy web services. To develop such syst...
Alexander Kozlenkov, George Spanoudakis, Andrea Zi...
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
14 years 1 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 7 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
NHM
2010
87views more  NHM 2010»
13 years 1 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...