4536 search results - page 357 / 908 » Contention-Sensitive Data Structures and Algorithms |
243
click to vote
FPGA
1999
ACM
15 years 11 months ago
1999
ACM
Pipelining of data path structures increases the throughput rate at the expense of enlarged resource usage and latency unless architectures optimized towards specific applications...
320
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
218
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
201
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Providing scalable database services is an essential requirement for extending many existing applications of the Cloud platform. Due to the diversity of applications, database ser...
210
click to vote
WWW
2009
ACM
15 years 11 months ago
2009
ACM
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...