Sciweavers

1632 search results - page 180 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
SIGIR
2000
ACM
15 years 8 months ago
Hill climbing algorithms for content-based retrieval of similar configurations
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
Dimitris Papadias
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
16 years 5 months ago
TCAM-conscious Algorithms for Data Streams
Recently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techni...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
CLEIEJ
2002
113views more  CLEIEJ 2002»
15 years 4 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...
APWEB
2004
Springer
15 years 9 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
15 years 10 months ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng