Sciweavers

11160 search results - page 220 / 2232
» Incompleteness in a General Setting
Sort
View
NIPS
2004
15 years 5 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
DATE
2006
IEEE
82views Hardware» more  DATE 2006»
15 years 10 months ago
Concurrent core test for SOC using shared test set and scan chain disable
A concurrent core test approach is proposed to reduce the test cost of SOC. Multiple cores in SOC can be tested simultaneously by using a shared test set and scan chain disable. P...
Gang Zeng, Hideo Ito
HSNMC
2004
Springer
172views Multimedia» more  HSNMC 2004»
15 years 9 months ago
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao
ASP
2003
Springer
15 years 9 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
NIPS
2004
15 years 5 months ago
Semigroup Kernels on Finite Sets
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of posi...
Marco Cuturi, Jean-Philippe Vert