3575 search results - page 302 / 715 » Structured motifs search |
227
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
164
click to vote
ARSCOM
2007
15 years 7 months ago
2007
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
177
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
178
click to vote
WSDM
2010
ACM
16 years 4 months ago
2010
ACM
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
161
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...