2434 search results - page 199 / 487 » Algorithmic Randomness of Closed Sets |
135
Voted
WEBDB
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
155
Voted
IJCAI
2001
15 years 5 months ago
2001
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
Design ECO commonly happens in industry due to constraints or target changes from manufacturing, marketing, reliability, or performance. At each step, designers usually want to mo...
145
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
153
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...