Sciweavers

4850 search results - page 125 / 970
» Approximate Data Structures with Applications
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICIP
2002
IEEE
15 years 11 months ago
Reduced DCT approximations for low bit rate coding
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT...
Ricardo L. de Queiroz
ESWS
2009
Springer
15 years 4 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
WWW
2001
ACM
15 years 10 months ago
Algorithms and programming models for efficient representation of XML for Internet applications
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
Neel Sundaresan, Reshad Moussa
BMCBI
2004
127views more  BMCBI 2004»
14 years 10 months ago
MolTalk - a programming library for protein structures and structure analysis
Background: Two of the mostly unsolved but increasingly urgent problems for modern biologists are a) to quickly and easily analyse protein structures and b) to comprehensively min...
Alexander V. Diemand, Holger Scheib