1413 search results - page 98 / 283 » Bisimilarity of Open Terms |
201
click to vote
PARA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
152
click to vote
ACMICEC
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we describe a business-to-business (B2B) testbed co-sponsored by the Open Applications Group, Inc. (OAGI) and the National Institute of Standard and Technology (NIS...
163
click to vote
WIDM
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we describe a prototype system for information retrieval on the Internet. Our idea is that the Web has to be searched both semantically and syntactically. In order t...
149
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
115
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Research suggests that in order for GSS to be deployed successfully over the long term, it must be integrated into the daily work practices of an organization, in support of repea...