1688 search results - page 116 / 338 » The Complexity of Rationalizing Matchings |
183
click to vote
BIBM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput proteinprot...
122
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
155
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
176
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
188
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...