5210 search results - page 219 / 1042 » Exact geometric computation |
183
Voted
TCS
2011
15 years 1 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
171
click to vote
PDP
2007
IEEE
16 years 12 days ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
174
click to vote
WECWIS
2005
IEEE
15 years 11 months ago
2005
IEEE
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
155
Voted
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
161
click to vote
ACMICEC
2003
ACM
15 years 11 months ago
2003
ACM
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...