Sciweavers

12825 search results - page 2054 / 2565
» Improved PLSOM algorithm
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
P-N learning: Bootstrapping binary classifiers by structural constraints
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
Zdenek Kalal, Jiri Matas, Krystian Mikolajczyk
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
15 years 4 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
IS
2010
15 years 4 months ago
Building concepts for AI agents using information theoretic Co-clustering
Abstract--High level conceptual thought seems to be at the basis of the impressive human cognitive ability, and AI researchers aim to replicate this ability in artificial agents. C...
Jason R. Chen
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
APNOMS
2007
Springer
15 years 11 months ago
Constella: A Complete IP Network Topology Discovery Solution
Network topology discovery for the large IP networks is a very well studied area of research. Most of the previous work focus on improving the efficiency in terms of time and compl...
Fawad Nazir, Tallat Hussain Tarar, Faran Javed Cha...
« Prev « First page 2054 / 2565 Last » Next »