2168 search results - page 132 / 434 » Randomized Algorithms and Complexity Theory |
117
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
110
click to vote
ELPUB
2006
ACM
15 years 9 months ago
2006
ACM
A text parsing component designed to be part of a system that assists students in academic reading an writing is presented. The parser can automatically add a relational discourse...
129
click to vote
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Schema evolution is an unavoidable consequence of the application development lifecycle. The two primary schemas in an application, the client conceptual object model and the pers...
128
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
115
Voted
WSC
2001
15 years 4 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...