1921 search results - page 141 / 385 » Stereo Without Search |
109
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
125
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
153
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
138
click to vote
ICML
2000
IEEE
16 years 4 months ago
2000
IEEE
Clustering algorithms conduct a search through the space of possible organizations of a data set. In this paper, we propose two types of instance-level clustering constraints ? mu...
121
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
This paper proposes a method of crawling Web servers connected to the Internet without imposing a high processing load. We are using the crawler for a field survey of the digital ...