3894 search results - page 413 / 779 » Approximation Algorithms for Biclustering Problems |
135
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
169
click to vote
ICIP
2008
IEEE
16 years 6 months ago
2008
IEEE
Two Dimensional Hidden Markov Models (2D-HMMs) provide substantial benefits for many computer vision and image analysis applications. Many fundamental image analysis problems, inc...
138
click to vote
CDC
2010
IEEE
14 years 12 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
180
click to vote
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
358
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...