Sciweavers

332 search results - page 50 / 67
» Space Complexity vs. Query Complexity
Sort
View
ICDCS
1999
IEEE
14 years 2 months ago
Scalable Processing of Read-Only Transactions in Broadcast Push
Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. In this...
Evaggelia Pitoura, Panos K. Chrysanthis
CP
2006
Springer
14 years 1 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
AMR
2008
Springer
288views Multimedia» more  AMR 2008»
13 years 11 months ago
Automatic Reduction of MIDI Files Preserving Relevant Musical Content
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...
Søren Tjagvad Madsen, Rainer Typke, Gerhard...
SIGIR
2008
ACM
13 years 9 months ago
Crosslingual location search
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
Tanuja Joshi, Joseph Joy, Tobias Kellner, Udayan K...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci