Sciweavers

69 search results - page 3 / 14
» Efficient Isomorphism Testing for a Class of Group Extension...
Sort
View
ACCV
2007
Springer
15 years 7 months ago
Efficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
161
Voted
DM
2006
128views more  DM 2006»
15 years 3 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
132
Voted
DLT
2008
15 years 5 months ago
Tree Automata with Global Constraints
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
124
Voted
EDBT
2008
ACM
160views Database» more  EDBT 2008»
15 years 5 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
131
Voted
IROS
2007
IEEE
122views Robotics» more  IROS 2007»
15 years 10 months ago
Lagrangian dynamics of open multibody systems with generalized holonomic and nonholonomic joints
— Standard methods to model multibody systems are aimed at systems with configuration spaces isomorphic to Rn . This limitation leads to singularities and other artifacts in cas...
Vincent Duindam, Stefano Stramigioli