1282 search results - page 212 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
146
Voted
TCAD
2008
15 years 2 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
145
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
126
click to vote
PAKDD
2010
ACM
15 years 12 days ago
2010
ACM
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
133
click to vote
COMAD
2009
15 years 3 months ago
2009
We present a class of web queries whose result is a multi-column relation instead of a collection of unstructured documents as in standard web search. The user specifies the query...
120
click to vote
DATE
2004
IEEE
15 years 6 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...