4114 search results - page 143 / 823 » Efficient Algorithms for the 2-Center Problems |
284
Voted
NLP
2000
15 years 9 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
132
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
168
click to vote
DAWAK
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
167
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
140
click to vote
DCOSS
2007
Springer
15 years 10 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...