Sciweavers

2292 search results - page 254 / 459
» A Data Model and Data Structures for Moving Objects Database...
Sort
View
SIGIR
2009
ACM
15 years 9 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
EUROPAR
2008
Springer
15 years 4 months ago
A Search Engine Index for Multimedia Content
We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study wi...
Mauricio Marín, Veronica Gil Costa, Carolin...
108
Voted
SC
2004
ACM
15 years 7 months ago
Big Wins with Small Application-Aware Caches
Large datasets, on the order of GB and TB, are increasingly common as abundant computational resources allow practitioners to collect, produce and store data at higher rates. As d...
Julio C. López, David R. O'Hallaron, Tianka...
DOLAP
2005
ACM
15 years 4 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
383
Voted
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 6 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...