5473 search results - page 1034 / 1095 » On the graph isomorphism problem |
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
127
Voted
KDD
2002
ACM
16 years 1 months ago
2002
ACM
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential f...
130
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
182
Voted
VLDB
2008
ACM
16 years 28 days ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
110
Voted
ICCAD
2006
IEEE
15 years 9 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...