Sciweavers

491 search results - page 68 / 99
» Optimizing Large OODB Queries
Sort
View
HIPEAC
2009
Springer
14 years 2 months ago
Collective Optimization
Abstract. Iterative compilation is an efficient approach to optimize programs on rapidly evolving hardware, but it is still only scarcely used in practice due to a necessity to gat...
Grigori Fursin, Olivier Temam
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
MOBICOM
2004
ACM
14 years 1 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 2 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
EDBTW
2010
Springer
13 years 6 months ago
Using visual pages analysis for optimizing web archiving
Due to the growing importance of the World Wide Web, archiving it has become crucial for preserving useful source of information. To maintain a web archive up-to-date, crawlers ha...
Myriam Ben Saad, Stéphane Gançarski