5595 search results - page 281 / 1119 » Approximation Algorithms for Clustering Problems |
137
click to vote
AVI
2008
15 years 9 months ago
2008
Acquiring small targets on a tablet or touch screen can be challenging. To address the problem, researchers have proposed techniques that enlarge the effective size of targets by ...
175
click to vote
ACSC
2005
IEEE
16 years 8 days ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
233
click to vote
EMNLP
2008
15 years 8 months ago
2008
This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environment...
150
click to vote
ATAL
2005
Springer
16 years 6 days ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
168
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...