2127 search results - page 37 / 426 » Computing large matchings fast |
147
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
121
click to vote
NIPS
2003
15 years 4 months ago
2003
In applying Hidden Markov Models to the analysis of massive data streams, it is often necessary to use an artificially reduced set of states; this is due in large part to the fac...
136
Voted
SDM
2009
SIAM
16 years 18 days ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
129
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
124
Voted
SDM
2009
SIAM
16 years 18 days ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...