Sciweavers

2089 search results - page 231 / 418
» A New Problem in String Searching
Sort
View
DBA
2006
236views Database» more  DBA 2006»
15 years 4 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
SIGIR
2012
ACM
13 years 5 months ago
Automatic term mismatch diagnosis for selective query expansion
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
Le Zhao, Jamie Callan
AAAI
2000
15 years 4 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
LCPC
1997
Springer
15 years 7 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
KBSE
2006
IEEE
15 years 9 months ago
Sieve: A Tool for Automatically Detecting Variations Across Program Versions
Software systems often undergo many revisions during their lifetime as new features are added, bugs repaired, abstractions simplified and refactored, and performance improved. Wh...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...