2309 search results - page 381 / 462 » Efficient Topological Exploration |
147
click to vote
AIPS
2004
15 years 7 months ago
2004
In this paper we analyze and extend a recently developed "task-swapping procedure" for improving schedules in oversubscribed situations. In such situations, there are ta...
201
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
173
click to vote
ERSA
2004
15 years 7 months ago
2004
Delay budget is an excess delay that each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quali...
199
click to vote
FAST
2004
15 years 7 months ago
2004
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
163
click to vote
ECIR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper describes an efficient method to construct reliable machine learning applications in peer-to-peer (P2P) networks by building ensemble based meta methods. We co...