4536 search results - page 572 / 908 » Contention-Sensitive Data Structures and Algorithms |
166
click to vote
AAAI
1998
15 years 8 months ago
1998
This paper describes a data compression chip for the high-precision electrophotographic printer using Evolvable Hardware (EHW). EHW is a new hardware paradigm which combines Genet...
193
click to vote
CGF
2010
15 years 6 months ago
2010
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
183
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
169
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
189
click to vote
ISBI
2008
IEEE
16 years 7 months ago
2008
IEEE
Most clustering algorithms in fMRI analysis implicitly require some nontrivial assumption on data structure. Due to arbitrary distribution of fMRI time series in the temporal doma...