5606 search results - page 492 / 1122 » Randomization Techniques for Graphs. |
170
click to vote
DAWAK
2007
Springer
16 years 1 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
167
click to vote
ASPDAC
2006
ACM
16 years 24 days ago
2006
ACM
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
151
click to vote
ER
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Deploying process-driven information systems is a time-consuming and error-prone task. Process mining attempts to improve this by automatically generating a process model...
172
click to vote
DCC
2010
IEEE
15 years 12 months ago
2010
IEEE
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...
208
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...