Sciweavers

2703 search results - page 47 / 541
» Working Class Hero
Sort
View
121
Voted
ENDM
2006
96views more  ENDM 2006»
15 years 2 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...
112
Voted
JSC
2011
71views more  JSC 2011»
14 years 9 months ago
Chern numbers of smooth varieties via homotopy continuation and intersection theory
Homotopy continuation provides a numerical tool for computing the equivalence of a smooth variety in an intersection product. Intersection theory provides a theoretical tool for re...
Sandra Di Rocco, David Eklund, Chris Peterson, And...
119
Voted
ICGI
2004
Springer
15 years 8 months ago
Identifying Clusters from Positive Data
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
John Case, Sanjay Jain, Eric Martin, Arun Sharma, ...
112
Voted
ACTA
2006
154views more  ACTA 2006»
15 years 2 months ago
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Linqiang Pan, Artiom Alhazov
ECCV
2008
Springer
16 years 4 months ago
Constructing Category Hierarchies for Visual Recognition
Abstract. Class hierarchies are commonly used to reduce the complexity of the classification problem. This is crucial when dealing with a large number of categories. In this work, ...
Marcin Marszalek, Cordelia Schmid