4110 search results - page 633 / 822 » Efficient algorithms for the 2-gathering problem |
195
click to vote
IWCMC
2006
ACM
16 years 13 days ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
185
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
242
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
189
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
202
click to vote
ASIAN
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...