2652 search results - page 359 / 531 » Privacy-preserving linear programming |
128
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
124
click to vote
GREC
2003
Springer
15 years 8 months ago
2003
Springer
To date many methods and programs for automatic text recognition exist. However there are no effective text recognition systems for graphic documents. Graphic documents usually con...
124
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
106
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
120
click to vote
ICTAI
1999
IEEE
15 years 7 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...