1887 search results - page 353 / 378 » Clustering with Local Restrictions |
SODA
2007
ACM
14 years 11 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
NIPS
2004
14 years 11 months ago
2004
We describe a framework for learning an object classifier from a single example. This goal is achieved by emphasizing the relevant dimensions for classification using available ex...
AAAI
2000
14 years 11 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
103
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
BMCBI
2010
14 years 9 months ago
2010
Background: The impressive increase of novel RNA structures, during the past few years, demands automated methods for structure comparison. While many algorithms handle only small...