Sciweavers

9532 search results - page 1552 / 1907
» Logic, Graphs, and Algorithms
Sort
View
OPODIS
2008
15 years 8 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
MLMTA
2007
15 years 8 months ago
Consensus Based Ensembles of Soft Clusterings
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
Kunal Punera, Joydeep Ghosh
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 8 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
186
Voted
CLA
2004
15 years 8 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig
NIPS
2004
15 years 8 months ago
Co-Training and Expansion: Towards Bridging Theory and Practice
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
Maria-Florina Balcan, Avrim Blum, Ke Yang
« Prev « First page 1552 / 1907 Last » Next »