3991 search results - page 265 / 799 » Bounding homogeneous models |
198
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
199
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
141
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
embedded in a sliding-window scheme. Such exhaustive
search involves massive computation. Efficient Subwindow
Search (ESS) [11] avoids this by means of branch
and bound. However...
118
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
Modeling consistency of style in isogenous fields of patterns (such as character patterns in a word from the same font or writer) can improve classification accuracy. Since such p...
159
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...